To prove that P ≠ NP, it suffices to prove a superpolynomial lower bound on Boolean circuit complexity of a function from NP. Currently, we are not even close to achieving this goal: we do not know how to prove a 4n lower bound. What is more depressing is that there are almost no techniques for proving circuit lower bounds. In this note, we briefly review various approaches that could potentially lead to stronger linear or superlinear lower bounds for unrestricted Boolean circuits (i.e., circuits with no restriction on depth, fan-out, or basis).
CITATION STYLE
Kulikov, A. S. (2018). Lower bounds for unrestricted boolean circuits: Open problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10846 LNCS, pp. 15–22). Springer Verlag. https://doi.org/10.1007/978-3-319-90530-3_2
Mendeley helps you to discover research relevant for your work.