We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, ...
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...