On the complexity of worst case and expected time in a circuit

DOI10.1007/3-540-60922-9_25zbMath1379.68166OpenAlexW1496519673MaRDI QIDQ4593940

Christian Schindelhauer, Andreas Jakoby

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_25

zbMATH Keywords

computational complexityaverage-case analysisworst caseexpected timetheory of parallel and distributed computationtimed circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Malign distributions for average case circuit complexity.

This page was built for publication: On the complexity of worst case and expected time in a circuit