Pages that link to "Item:Q1853491"
From MaRDI portal
The following pages link to Faster exact solutions for some NP-hard problems. (Q1853491):
Displaying 8 items.
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Speedup for natural problems and noncomputability (Q620964) (← 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)
- New algorithms for exact satisfiability (Q1770407) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- (Q4938786) (← links)
- Faster exact algorithms for hard problems: A parameterized point of view (Q5931443) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)