Using hardness vs randomness to design low-space algorithms

MaRDI QIDQ7241338zbMATH OpenFDO

Authors Edward Pyne, Roei Tell

Publication date 12 May 2026

Published in Bulletin of the European Association for Theoretical Computer Science EATCS (Search for Journal in Brave)

Full work available at URL https://bulletin.eatcs.org/index.php/beatcs/article/view/880/942

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Analysis of algorithms (68W40)

This page was built for publication: Using hardness vs randomness to design low-space algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241338)