Pages that link to "Item:Q1777401"
From MaRDI portal
The following pages link to Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401):
Displaying 6 items.
- New algorithms for exact satisfiability (Q1770407) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← 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)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705953) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)