Pages that link to "Item:Q2875149"
From MaRDI portal
The following pages link to Improving exhaustive search implies superpolynomial lower bounds (Q2875149):
Displaying 19 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Robust simulations and significant separations (Q2407096) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- (Q5009542) (← links)
- (Q5090378) (← links)
- (Q5743451) (← links)
