Add to ORKGEvery language that is polynomial time many-one hard for ESPACE is shown to have unusually small complexity cores and unusually low space-bounded Kolmogorov complexity. It follows that the polynomial time many-one complete languages form a measure 0 subset of ESPACE
We show that there exist properties that are maximally hard for testing, while still admitting PCPPs...
AbstractWe consider how much error a fixed depth Boolean circuit must make in computing the parity f...
The Minimum Circuit Size Problem (MCSP) is known to be hard for statistical zero knowledge via a BPP...
It is known from work of Bennett and Gill and Ambos-Spies that the following condi-tions are equival...
AbstractCircuit-size complexity is compared with deterministic and nondeterministic time complexity ...
Every language that is polynomial time many-one hard for ESPACE is shown to have unusually small com...
AbstractIt is shown that almost every language in ESPACE is very hard to approximate with circuits. ...
AbstractIn this paper we extend a key result of Nisan and Wigderson (J. Comput. System Sci. 49 (1994...
AbstractIt is shown that P(A)∩P(B)=BPPP holds for every algorithmically random oracle A⊕B. This resu...
We show that BPP has either SUBEXP-dimension zero (randomness is easy) or BPP = EXP (randomness is ...
The complexity class BPP (defined by Gill) contains problems that can be solved in polynomial time w...
AbstractResource-boundedmeasure as originated by Lutz is an extension of classical measure theory wh...
Circuit-size complexity is compared with deterministic and nondeterministic time complexity in the p...
We use Lutz's resource bounded measure theory to prove that, either RP is small, or ZPP is hard. M...
As soon as Bennett and Gill first demonstrated that, relative to a randomly chosen oracle, P is not ...
We show that there exist properties that are maximally hard for testing, while still admitting PCPPs...
AbstractWe consider how much error a fixed depth Boolean circuit must make in computing the parity f...
The Minimum Circuit Size Problem (MCSP) is known to be hard for statistical zero knowledge via a BPP...
It is known from work of Bennett and Gill and Ambos-Spies that the following condi-tions are equival...
AbstractCircuit-size complexity is compared with deterministic and nondeterministic time complexity ...
Every language that is polynomial time many-one hard for ESPACE is shown to have unusually small com...
AbstractIt is shown that almost every language in ESPACE is very hard to approximate with circuits. ...
AbstractIn this paper we extend a key result of Nisan and Wigderson (J. Comput. System Sci. 49 (1994...
AbstractIt is shown that P(A)∩P(B)=BPPP holds for every algorithmically random oracle A⊕B. This resu...
We show that BPP has either SUBEXP-dimension zero (randomness is easy) or BPP = EXP (randomness is ...
The complexity class BPP (defined by Gill) contains problems that can be solved in polynomial time w...
AbstractResource-boundedmeasure as originated by Lutz is an extension of classical measure theory wh...
Circuit-size complexity is compared with deterministic and nondeterministic time complexity in the p...
We use Lutz's resource bounded measure theory to prove that, either RP is small, or ZPP is hard. M...
As soon as Bennett and Gill first demonstrated that, relative to a randomly chosen oracle, P is not ...
We show that there exist properties that are maximally hard for testing, while still admitting PCPPs...
AbstractWe consider how much error a fixed depth Boolean circuit must make in computing the parity f...
The Minimum Circuit Size Problem (MCSP) is known to be hard for statistical zero knowledge via a BPP...