Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits

DOI10.1007/978-3-319-17142-5_8zbMath1460.68041OpenAlexW747722920MaRDI QIDQ2948455

Ning Ding

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_8

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma

This page was built for publication: Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits