The following pages link to Satisfiability coding lemma (Q4484662):
Displaying 37 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)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- A randomized algorithm for 3-SAT (Q626900) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- Prediction from partial information and hindsight, an alternative proof (Q1751431) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Complete on average Boolean satisfiability (Q1872642) (← links)
- A combinatorial analysis for the critical clause tree (Q1946495) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- On extremal \(k\)-CNF formulas (Q2509734) (← links)
- The state of SAT (Q2643296) (← links)
- Exploiting partial knowledge of satisfying assignments (Q2643304) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- The Complexity of Satisfiability of Small Depth Circuits (Q3656852) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- (Q5028438) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- (Q5090378) (← links)
- Super strong ETH is true for PPSZ with small resolution width (Q5092450) (← links)
- (Q5743451) (← links)
- On Super Strong ETH (Q5856463) (← links)
- An improvement of the algorithm of Hertli for the unique 3SAT problem (Q5919321) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)
- Depth-3 circuits for inner product (Q6614883) (← links)
- CNF encodings of symmetric functions (Q6635697) (← links)
- PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster (Q6655885) (← links)
