scientific article; zbMATH DE number 1789922
From MaRDI portal
Publication:4549233
zbMath1012.68080MaRDI QIDQ4549233
Publication date: 27 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
probabilistic algorithmscircuit complexityderandomizationprobabilistic complexity classespseudo-randomnesscomplexity classesalgebraic circuit complexity
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items
Random oracles and non-uniformity, Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, List-Decoding with Double Samplers