scientific article; zbMATH DE number 1405801
From MaRDI portal
Publication:4938786
Recommendations
- Faster exact solutions for some NP-hard problems.
- Faster exact algorithms for hard problems: A parameterized point of view
- An introduction to exponential time exact algorithms for solving NP-hard problems
- scientific article; zbMATH DE number 1953201
- Faster exact algorithms for some terminal set problems
- Faster exact algorithms for some terminal set problems
- STACS 2005
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
- scientific article; zbMATH DE number 1560343
- scientific article; zbMATH DE number 1775419
Cited in
(11)- An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems
- On space-efficient algorithms for certain NP-complete problems
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\)
- Faster exact solutions for some NP-hard problems.
- An introduction to exponential time exact algorithms for solving NP-hard problems
- More about Exact Slow $k$-Nim
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- Faster exact algorithms for hard problems: A parameterized point of view
- Algorithms for four variants of the exact satisfiability problem
- Revising non-monotonic theories with sufficient and necessary conditions: the case of defeasible logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938786)
