Range avoidance and the complexity of explicit constructions

MaRDI QIDQ6995081zbMATH OpenFDO

Authors Oliver Korten

Publication date 22 April 2025

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

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/825/876

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

This page was built for publication: Range avoidance and the complexity of explicit constructions

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