Computer Science Logic
Springer Science & Business Media
Chapter title |
The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness
|
---|---|
Chapter number | 9 |
Book title |
Computer Science Logic
|
Published by |
Springer, Berlin, Heidelberg, September 1992
|
DOI | 10.1007/3-540-56992-8_9 |
Book ISBNs |
978-3-54-056992-3, 978-3-54-047890-4
|
Authors |
Nadia Creignou, Creignou, Nadia |