| Learning with Distributional Inverters | 0 | 0.34 | 2022 |
| LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic | 0 | 0.34 | 2021 |
| Lifting for Constant-Depth Circuits and Applications to MCSP. | 0 | 0.34 | 2021 |
| On the Hierarchical Community Structure of Practical Boolean Formulas | 0 | 0.34 | 2021 |
| AC0[p] Lower Bounds against MCSP via the Coin Problem. | 0 | 0.34 | 2019 |
| Compression Improves Image Classification Accuracy. | 0 | 0.34 | 2019 |
| The Proof Complexity Of Smt Solvers | 0 | 0.34 | 2018 |
| Stabbing Planes. | 0 | 0.34 | 2017 |
| Does Looking Inside a Circuit Help? | 0 | 0.34 | 2017 |
| Expander construction in VNC1 | 0 | 0.34 | 2017 |
| Agnostic Learning from Tolerant Natural Proofs. | 1 | 0.34 | 2017 |
| Algorithms from Natural Lower Bounds. | 0 | 0.34 | 2016 |
| Learning Algorithms from Natural Proofs. | 3 | 0.37 | 2016 |
| Mining Circuit Lower Bound Proofs for Meta-Algorithms | 13 | 0.58 | 2015 |
| Complexity of alignment and decoding problems: restrictions and approximations | 0 | 0.34 | 2015 |
| Tighter Connections between Derandomization and Circuit Lower Bounds. | 2 | 0.36 | 2015 |
| Approximating solution structure of the Weighted Sentence Alignment problem. | 0 | 0.34 | 2014 |
| Compression of Boolean Functions. | 3 | 0.45 | 2013 |
| Expressing versus Proving: Relating Forms of Complexity in Logic. | 0 | 0.34 | 2012 |
| On the complexity of model expansion | 4 | 0.44 | 2010 |
| An Axiomatic Approach to Algebrization. | 7 | 0.46 | 2009 |
| Many Facets of Complexity in Logic | 0 | 0.34 | 2008 |
| Closure properties of weak systems of bounded arithmetic | 1 | 0.36 | 2005 |
| A Second-Order Theory for NL | 4 | 0.49 | 2004 |
| A second-order system for polytime reasoning based on Grädel's theorem | 9 | 0.76 | 2003 |
| A Second-Order System for Polytime Reasoning Using Grädel's Theorem | 3 | 0.40 | 2001 |
