The following pages link to (Q4938786):
Displaying 8 items.
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems (Q1101220) (← links)
- On space-efficient algorithms for certain NP-complete problems (Q1314378) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- More about Exact Slow $k$-Nim (Q3390058) (← links)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance (Q3563012) (← links)
- Faster exact algorithms for hard problems: A parameterized point of view (Q5931443) (← links)
