Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations
From MaRDI portal
Publication:6612541
DOI10.1016/J.TCS.2024.114747MaRDI QIDQ6612541
Author name not available (Why is that?)
Publication date: 1 October 2024
Published in: (Search for Journal in Brave)
No records found.
No records found.
This page was built for publication: Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612541)