Nadia Creignou. The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. In Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter, editors, Computer Science Logic, 6th Workshop, CSL 92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers. Volume 702 of Lecture Notes in Computer Science, pages 115-133, Springer, 1992.
@inproceedings{Creignou92,
title = {The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness},
author = {Nadia Creignou},
year = {1992},
tags = {completeness},
researchr = {https://researchr.org/publication/Creignou92},
cites = {0},
citedby = {0},
pages = {115-133},
booktitle = {Computer Science Logic, 6th Workshop, CSL 92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers},
editor = {Egon Börger and Gerhard Jäger and Hans Kleine Büning and Simone Martini and Michael M. Richter},
volume = {702},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-56992-8},
}