Pages that link to "Item:Q354655"
From MaRDI portal
The following pages link to A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655):
Displaying 17 items.
- An improved deterministic \#SAT algorithm for small De Morgan formulas (Q334923) (← links)
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- On the complexity of unique circuit SAT (Q2202678) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle (Q2818003) (← links)
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (Q2946392) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385) (← links)
- (Q5002674) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
