RANDOMNESS — A COMPUTATIONAL COMPLEXITY PERSPECTIVE
From MaRDI portal
Publication:2929280
DOI10.1142/9789814449243_0015zbMath1298.68197OpenAlexW4230950736MaRDI QIDQ2929280
Publication date: 11 November 2014
Published in: XVIIth International Congress on Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789814449243_0015
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)