Pages that link to "Item:Q5956013"
From MaRDI portal
The following pages link to Easiness assumptions and hardness tests: Trading time for zero error (Q5956013):
Displaying 13 items.
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- Robust simulations and significant separations (Q2407096) (← links)
- Natural Proofs versus Derandomization (Q2805512) (← links)
- (Q5002697) (← links)
- A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES (Q5714674) (← links)
- Unions of Disjoint NP-Complete Sets (Q5892145) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Constructive separations and their consequences (Q6566463) (← links)
