External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Nadia Creignou. The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. In Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter, editors, Computer Science Logic, 6th Workshop, CSL 92, San Miniato, Italy, September 28 - October 2, 1992, Selected Papers. Volume 702 of Lecture Notes in Computer Science, pages 115-133, Springer, 1992.

Abstract

Abstract is missing.

runs on