Completeness and weak completeness under polynomial-size circuits

DOI10.1007/3-540-59042-0_59zbMath1379.68167OpenAlexW1506906837MaRDI QIDQ4596607

Jack H. Lutz, David W. Juedes

Publication date: 4 December 2017

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

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_59

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Completeness and weak completeness under polynomial-size circuits