Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
© Lijie Chen, Dylan M. McKay, Cody D. Murray, and R. Ryan Williams; licensed under Creative Commons License CC-BY 34th Computational Complexity Conference (CCC 2019). A frontier open problem in circuit complexity is to prove PNP 6⊂ SIZE[nk] for all k; this is a necessary intermediate step towards NP...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137582 |