P, NP, and NP-Completeness (Q3066266): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | P, NP, and NP-Completeness |
scientific article |
Statements
P, NP, and NP-Completeness (English)
0 references
10 January 2011
0 references
NP-computability
0 references
NP-completeness
0 references
P versus NP
0 references
polynomial time checking
0 references
polynomial time computation
0 references
polynomial time find
0 references
