Pages that link to "Item:Q706635"

The following pages link to An improved deterministic local search algorithm for 3-SAT (Q706635):

Displaying 14 items.

• Derandomizing the HSSW algorithm for 3-SAT (Q378221) (← links)
• A randomized algorithm for 3-SAT (Q626900) (← links)
• Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
• Foundations of \(r\)-contiguous matching in negative selection for anomaly detection (Q734206) (← links)
• Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
• Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
• Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
• Theoretical advances in artificial immune systems (Q2518373) (← links)
• Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
• Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
• A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (Q3502705) (← links)
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
• Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT (Q5002768) (← links)