Pages that link to "Item:Q2577590"
From MaRDI portal
The following pages link to An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof (Q2577590):
Displaying 4 items.
- New algorithms for exact satisfiability (Q1770407) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY (Q2941085) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)