On universally easy classes for NP-complete problems. (Q1401418)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On universally easy classes for NP-complete problems. |
scientific article |
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
