The following pages link to (Q4589023):
Displaying 6 items.
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- (Q4638059) (← links)
- Tighter connections between Formula-SAT and shaving logs (Q5002674) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q5402558) (← links)