Pages that link to "Item:Q1200758"
From MaRDI portal
The following pages link to An efficient algorithm for the 3-satisfiability problem (Q1200758):
Displaying 18 items.
- An efficient algorithm for 3NF determination (Q558039) (← links)
- Three ``quantum'' algorithms to solve 3-SAT (Q872207) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem (Q1736511) (← links)
- Toward leaner binary-clause reasoning in a satisfiability solver (Q1777406) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- Combining preorder and postorder resolution in a satisfiability solver (Q2741518) (← links)
- Improved polynomial algorithm for 3-SAT (Q2888310) (← links)
- Computationally hard problems: 3-SAT and its polynomial solvability (Q2888335) (← links)
- (Q3166129) (← links)
- (Q3181641) (← links)
- An improved local search algorithm for 3-SAT (Q3439130) (← links)
- 3-Valued Circuit SAT for STE with Automatic Refinement (Q3510816) (← links)
- A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)
- An improvement of the algorithm of Hertli for the unique 3SAT problem (Q5915639) (← links)