Pages that link to "Item:Q2848219"

The following pages link to Improving exhaustive search implies superpolynomial lower bounds (Q2848219):

Displaying 34 items.

• A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
• Local reduction (Q1641001) (← links)
• Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
• Fourier concentration from shrinkage (Q2012185) (← links)
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
• Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
• Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
• Natural proofs versus derandomization (Q2805512) (← links)
• Improving exhaustive search implies superpolynomial lower bounds (Q2875149) (← links)
• Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
• (Q3191596) (← links)
• Lower bounds on black-box reductions of hitting to density estimation (Q3304157) (← links)
• Local Reductions (Q3448833) (← links)
• New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
• (Q4638059) (← links)
• Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
• Tighter connections between Formula-SAT and shaving logs (Q5002674) (← links)
• (Q5005182) (← links)
• Pseudo-Derandomizing Learning and Approximation (Q5009554) (← links)
• On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• Major 2 Satisfiability Logic in Discrete Hopfield Neural Network (Q5072024) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• (Q5090396) (← links)
• Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
• (Q5121894) (← links)
• Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
• Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
• Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
• Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
• Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
• Rigid matrices from rectangular PCPs (Q6491304) (← links)