- Reducibility among Fractional Stability Problems Shiva Kintali Laura J. Poplawski Rajmohan Rajaraman Ravi Sundaram Shang-Hua Teng Fri 02 March 2012
- Two-Variable First-Order Logic with Equivalence Closure Emanuel Kieroński Jakub Michaliszyn Ian Pratt-Hartmann Lidia Tendera Fri 02 March 2012
- On the Complexity of Computing Critical Points with Gröbner Bases Pierre-Jean Spaenlehauer Fri 02 March 2012
- Classical and Strong Convexity of Sublevel Sets and Application to Attainable Sets of Nonlinear Systems Alexander Weber Gunther Reissig Fri 02 March 2012
- A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities Jugal Garg Ruta Mehta Milind Sohoni Vijay V. Vazirani Fri 02 March 2012
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits Manindra Agrawal Rohit Gurjar Arpita Korwar Nitin Saxena Fri 02 March 2012
- The HOM Problem is EXPTIME-Complete Carles Creus Adrià Gascón Guillem Godoy Lander Ramos Fri 02 March 2012
- Rectangles Are Nonnegative Juntas Mika Göös Shachar Lovett Raghu Meka Thomas Watson David Zuckerman Fri 02 March 2012
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture Amir Abboud Virginia Vassilevska Williams Huacheng Yu Fri 02 March 2012
- Bipartite Perfect Matching is in Quasi-NC Stephen Fenner Rohit Gurjar Thomas Thierauf Fri 02 March 2012
- Enumerating Projections of Integer Points in Unbounded Polyhedra Danny Nguyen Igor Pak Fri 02 March 2012
- Deciding Parity Games in Quasi-polynomial Time Cristian S. Calude Sanjay Jain Bakhadyr Khoussainov Wei Li Frank Stephan Fri 02 March 2012
- A Faster Isomorphism Test for Graphs of Small Degree Martin Grohe Daniel Neuen Pascal Schweitzer Fri 02 March 2012
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms Venkatesan Guruswami Sai Sandeep Fri 02 March 2012
- On the Computation of An Saber N. Elaydi William A. Harris Fri 02 March 2012
- Classifying the Complexity of Constraints Using Finite Algebras Andrei Bulatov Peter Jeavons Andrei Krokhin Fri 02 March 2012
- The Potential of the Approximation Method Kazuyuki Amano Akira Maruoka Fri 02 March 2012
- Macro Tree Translations of Linear Size Increase are MSO Definable Joost Engelfriet Sebastian Maneth Fri 02 March 2012
- On the Hardness of Graph Isomorphism Jacobo Torán Fri 02 March 2012
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and CartiertextendashManin Operator Alin Bostan Pierrick Gaudry Éric Schost Fri 02 March 2012
Library Size: 13G (12947 entries),
Last Updated: Apr 08, 2026, 23:05:12,
Build Time: N/A
