What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7138698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) |
scientific article; zbMATH DE number 7138698 |
Statements
What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (English)
0 references
29 November 2019
0 references
P vs. NP
0 references
computational complexity
0 references
provability
0 references
determinism
0 references
nondeterminism
0 references
randomization
0 references
0.9086176753044128
0 references
0.7583324313163757
0 references
0.7504503130912781
0 references
0.7417186498641968
0 references
