Download:
|
by A. V. Naik, K. W. Regan, D. Sivakumar, On Theoretical
http://www.cs.iastate.edu/~jhitchco/cgi-bin/bib.cgi?rbm.ps
Add To MetaCart
Abstract:
[91] Y. Wang. NP-hard sets are superterse unless NP is small. Information Processing Letters, 61(1):1-6,
Citations
|
60
|
Measure on small complexity classes, with applications for BPP
– Allender, Strauss
- 1994
|
|
40
|
Resource-bounded measure and randomness
– Ambos-Spies, Mayordomo
- 1997
|
|
37
|
Resource bounded randomness and weakly complete problems
– Ambos-Spies, Terwijn, et al.
- 1997
|
|
28
|
Genericity and measure for exponential time
– Ambos-Spies, Neis, et al.
- 1996
|
|
26
|
Circuit complexity before the dawn of the new millennium
– Allender
- 1996
|
|
26
|
Resource-bounded balanced genericity, stochasticity and weak randomness
– Ambos-Spies, Mayordomo, et al.
- 1996
|
|
18
|
Measure on P: Robustness of the notion
– Allender, Strauss
- 1995
|
|
17
|
A comparison of weak completeness notions
– Ambos-Spies, Mayordomo, et al.
- 1996
|
|
16
|
Separating NP-completeness notions under strong hypotheses
– Ambos-Spies, Bentzien
- 1997
|
|
7
|
Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets
– Ambos-Spies, Lempp, et al.
- 1998
|
|
4
|
Almost complete sets
– Ambos-Spies, Merkle, et al.
- 2000
|
|
3
|
Measure theoretic completeness notions for the exponential time classes
– Ambos-Spies
- 2000
|
