Pages that link to "Item:Q5419094"
From MaRDI portal
The following pages link to A full derandomization of schöning's k-SAT algorithm (Q5419094):
Displaying 19 items.
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- 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)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- A combinatorial analysis for the critical clause tree (Q1946495) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← 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)
- Using small-scale quantum devices to solve algebraic equations (Q2690295) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768) (← links)
- (Q5091175) (← links)
- A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles (Q5218804) (← links)
- (Q5497123) (← links)
- (Q5743451) (← links)
