scientific article
From MaRDI portal
Publication:4023359
zbMath0755.68017MaRDI QIDQ4023359
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kolmogorov complexityComputational complexitycomputational complexity theoryoracle complexityresource-bounded programs
Analysis of algorithms and problem complexity (68Q25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
Randnomness, computability, and algebraic specifications ⋮ Exact constructive and computable dimensions ⋮ ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS ⋮ Algorithmic complexity of recursive and inductive algorithms ⋮ Mathematical metaphysics of randomness ⋮ Optimal representation in average using Kolmogorov complexity ⋮ Effective simultaneous approximability of reals.
This page was built for publication:
