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

Nadia Creignou

Browse the full CSL paper archive.