Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations

Juraj Hromkovic. Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations. Electronic Colloquium on Computational Complexity (ECCC), 28:49, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.