The following pages link to (Q5009542):
Displaying 9 items.
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- A threshold for a polynomial solution of \#2SAT (Q2892663) (← links)
- (Q4035673) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q5090378) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)