P, NP, and NP-Completeness (Q3066266): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/cbo9780511761355 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4251610435 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 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
