scientific article; zbMATH DE number 1361471
From MaRDI portal
Publication:4699289
zbMath0976.03063MaRDI QIDQ4699289
Publication date: 6 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (3)
Smaller superconcentrators of density 28 ⋮ Construction of expanders and superconcentrators using Kolmogorov complexity ⋮ Space bounds for resolution
This page was built for publication: