## Nadia Creignou

*The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness*

CSL, 1992.

@inproceedings{CSL-1992-Creignou, author = "Nadia Creignou", booktitle = "{Proceedings of the Sixth Workshop on Computer Science Logic}", doi = "10.1007/3-540-56992-8_9", isbn = "3-540-56992-8", pages = "115--133", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness}", volume = 702, year = 1992, }