Nadia Creignou The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. 115-133 1992 conf/csl/1992 CSL db/conf/csl/csl92.html#Creignou92 https://doi.org/10.1007/3-540-56992-8_9