Proving Circuit Lower Bounds in High Uniform Classes

DOI10.4036/iis.2014.1zbMath1286.68169OpenAlexW2095201089MaRDI QIDQ5417530

Akinori Kawachi

Publication date: 21 May 2014

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2014.1

zbMATH Keywords

computational complexitylower boundscircuitshigh uniform classesNP versus P conjecture

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Proving Circuit Lower Bounds in High Uniform Classes