The following pages link to (Q5501274):
Displayed 11 items.
- A randomized algorithm for 3-SAT (Q626900) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs (Q2475410) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes (Q3599204) (← links)