Pages that link to "Item:Q5494972"
From MaRDI portal
The following pages link to 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General (Q5494972):
Displayed 16 items.
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Local reduction (Q1641001) (← links)
- A combinatorial analysis for the critical clause tree (Q1946495) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Local Reductions (Q3448833) (← links)
- (Q5092465) (← links)
- (Q5743451) (← links)
- An improvement of the algorithm of Hertli for the unique 3SAT problem (Q5919321) (← links)
