Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

CC
2015
Springer

favoriteEmaildiscussreport

28views System Software» more CC 2015»

Mining Circuit Lower Bound Proofs for Meta-Algorithms

8 years 10 days ago

Mining Circuit Lower Bound Proofs for Meta-Algorithms

Download www.cs.sfu.ca

Ruiwen Chen, Valentine Kabanets, Antonina Kolokolo

Real-time Traffic

CC 2015 | System Software |

claim paper

Related Content

» A note on exponential circuit lower bounds from derandomizing ArthurMerlin games

» Cosmological lower bound on the circuit complexity of a small problem in logic

» A note on circuit lower bounds from derandomization

» Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates

» Circuit Complexity and Multiplicative Complexity of Boolean Functions

» Cracks in the Defenses Scouting Out Approaches on Circuit Lower Bounds

» Polynomial Vicinity Circuits and Nonlinear Lower Bounds

» A Switching Lemma for Small Restrictions and Lower Bounds for k DNF Resolution

» On Interpolation and Automatization for Frege Systems

» A Spectral Approach to Lower Bounds

Post Info
More Details (n/a)

Added	17 Apr 2016
Updated	17 Apr 2016
Type	Journal
Year	2015
Where	CC
Authors	Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman

Comments (0)