![]() |
@article{DBLP:journals/tcs/Creignou95,
author = {Nadia Creignou},
title = {The Class of Problems That are Linearly Equivalent to Satisfiability
or a Uniform Method for Proving NP-Completeness},
journal = {Theor. Comput. Sci.},
volume = {145},
number = {1{\&}2},
year = {1995},
pages = {111-145},
ee = {http://dx.doi.org/10.1016/0304-3975(94)00182-I},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-11-19 by Michael Ley (ley@uni-trier.de)