Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations (Q6612541)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations |
scientific article; zbMATH DE number 7920460
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations |
scientific article; zbMATH DE number 7920460 |
Statements
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations (English)
0 references
1 October 2024
0 references
Kolmogorov complexity
0 references
computational complexity
0 references
\(\mathrm{P}\)
0 references
\(\mathrm{NP}\)
0 references
nondeterminism
0 references
determinism
0 references