Login / Signup

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

Nadia Creignou
Published in: CSL (1992)
Keyphrases