The following pages link to (Q4747916):
Displayed 15 items.
- An improved upper bound for SAT (Q820534) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- An algorithm for exact satisfiability analysed with the number of clauses as parameter (Q1045885) (← links)
- Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
- New algorithms for exact satisfiability (Q1770407) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- On variable-weighted exact satisfiability problems (Q2462633) (← links)
- An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof (Q2577590) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- On Some SAT-Variants over Linear Formulas (Q3599093) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)