scientific article; zbMATH DE number 2156275
From MaRDI portal
Publication:4668733
zbMath1082.68038MaRDI QIDQ4668733
Publication date: 15 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Limits on alternation trading proofs for time-space lower bounds ⋮ Constant-space, constant-randomness verifiers with arbitrarily small error
This page was built for publication: