Searching for "The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB