- Record: found
- Abstract: not found
- Book Chapter: not found
Automata, Languages, and Programming
Backdoors to Acyclic SAT
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references21
- Record: found
- Abstract: not found
- Article: not found
The complexity of computing the permanent
L.G. Valiant (1979)
- Record: found
- Abstract: not found
- Conference Proceedings: not found
The complexity of theorem-proving procedures
Stephen Cook (1971)
- Record: found
- Abstract: not found
- Book: not found
Parameterized Complexity
R. G. Downey, M. Fellows (1999)
