Pages that link to "Item:Q2351392"
From MaRDI portal
The following pages link to Mining circuit lower bound proofs for meta-algorithms (Q2351392):
Displaying 31 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- A moderately exponential time algorithm for \(k\)-IBDD satisfiability (Q722517) (← links)
- Negation-limited formulas (Q729897) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← 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)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound (Q2963581) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
- A Moderately Exponential Time Algorithm for k-IBDD Satisfiability (Q3449853) (← links)
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- Tighter connections between Formula-SAT and shaving logs (Q5002674) (← links)
- Cubic Formula Size Lower Bounds Based on Compositions with Majority (Q5090412) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
