P, NP, and NP-Completeness (Q3066266): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:31, 5 March 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
