Pages that link to "Item:Q1321029"
From MaRDI portal
The following pages link to \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029):
Displaying 14 items.
- (Q5121895) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES (Q5714674) (← links)
- Hardness amplification within NP (Q5917544) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Easiness assumptions and hardness tests: Trading time for zero error (Q5956013) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)