On universally easy classes for NP-complete problems. (Q1401418)
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: On universally easy classes for NP-complete problems. |
scientific article; zbMATH DE number 1965412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On universally easy classes for NP-complete problems. |
scientific article; zbMATH DE number 1965412 |
Statements
On universally easy classes for NP-complete problems. (English)
0 references
17 August 2003
0 references
Complexity theory
0 references
Polynomial time
0 references
NP-completeness
0 references
Classes of instances
0 references
Universally polynomial
0 references
Universally simplifying
0 references
Regular languages
0 references
0.9932705760002136
0 references
0.7928010821342468
0 references
0.7522684335708618
0 references
0.7519110441207886
0 references
