Pages that link to "Item:Q2577590"

The following pages link to An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof (Q2577590):

Displayed 3 items.

• New algorithms for exact satisfiability (Q1770407) ‎ (← 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)