Pages that link to "Item:Q2475408"
From MaRDI portal
The following pages link to Proving SAT does not have small circuits with an application to the two queries problem (Q2475408):
Displaying 10 items.
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Arthur and Merlin as oracles (Q649095) (← links)
- The 1-versus-2 queries problem revisited (Q970102) (← links)
- Two queries (Q1961371) (← links)
- On zero error algorithms having oracle access to one query (Q2498984) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- Zero-One Designs Produce Small Hard SAT Instances (Q4931562) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)