The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness |
scientific article; zbMATH DE number 985369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness |
scientific article; zbMATH DE number 985369 |
Statements
The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (English)
0 references
28 February 1997
0 references
satisfiability
0 references
0 references
0.7922459840774536
0 references
0.7689990401268005
0 references
