- A Proof of the CSP Dichotomy Conjecture Dmitriy Zhuk Fri 02 March 2012
- Iterated lower bound formulas: a diagonalization-based approach to proof complexity Rahul Santhanam Iddo Tzameret Fri 02 March 2012
- Settling the complexity of Nash equilibrium in congestion games Yakov Babichenko Aviad Rubinstein Fri 02 March 2012
- The complexity of gradient descent: CLS = PPAD ąp PLS John Fearnley Paul W. Goldberg Alexandros Hollender Rahul Savani Fri 02 March 2012
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE Ruta Jawale Yael Tauman Kalai Dakshita Khurana Rachel Zhang Fri 02 March 2012
- A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path Sally Dong Yin Tat Lee Guanghao Ye Fri 02 March 2012
- Lower bounds for monotone arithmetic circuits via communication complexity Arkadev Chattopadhyay Rajit Datta Partha Mukhopadhyay Fri 02 March 2012
- The complexity of constrained min-max optimization Constantinos Daskalakis Stratis Skoulakis Manolis Zampetakis Fri 02 March 2012
- A dependently typed calculus with pattern matching and erasure inference Matúš Tejiščák Fri 02 March 2012
- On Nonconvex Optimization for Machine Learning Chi Jin Praneeth Netrapalli Rong Ge Sham M. Kakade Michael I. Jordan Fri 02 March 2012
- Scaling exact inference for discrete probabilistic programs Steven Holtzen Guy Van den Broeck Todd Millstein Fri 02 March 2012
- A modular cost analysis for probabilistic programs Martin Avanzini Georg Moser Michael Schaper Fri 02 March 2012
- On Hoare logic and Kleene algebra with tests Dexter Kozen Fri 02 March 2012
- łambda: computable semantics for differentiable programming with higher-order functions and datatypes Benjamin Sherman Jesse Michel Michael Carbin Fri 02 March 2012
- Automatic differentiation in PCF Damiano Mazza Michele Pagani Fri 02 March 2012
- Semantics-guided synthesis Jinwoo Kim Qinheping Hu Loris DtextquotesingleAntoni Thomas Reps Fri 02 March 2012
- The fine-grained and parallel complexity of andersen's pointer analysis Anders Alnor Mathiasen Andreas Pavlogiannis Fri 02 March 2012
- Context-bounded verification of liveness properties for multithreaded shared-memory programs Pascal Baumann Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Fri 02 March 2012
- Taming x86-TSO persistency Artem Khyzha Ori Lahav Fri 02 March 2012
- A pre-expectation calculus for probabilistic sensitivity Alejandro Aguirre Gilles Barthe Justin Hsu Benjamin Lucien Kaminski Joost-Pieter Katoen Christoph Matheja Fri 02 March 2012
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A
