- Subrecursive hierarchies via direct limits E. C. Dennis-Jones S. S. Wainer Fri 02 March 2012
- A mizar mode for HOL John Harrison Fri 02 March 2012
- On the simplex algorithm for networks and generalized networks James B. Orlin Fri 02 March 2012
- Two-Dimensional Prefix String Matching and Covering on Square Matrices M. Crochemore C. S. Iliopoulos M. Korda Fri 02 March 2012
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups Gábor Horváth Fri 02 March 2012
- Linear systems over localizations of rings Sebastian Posur Fri 02 March 2012
- Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures M. Fiore N. Gambino M. Hyland G. Winskel Fri 02 March 2012
- Cutting lemma and Zarankiewicz's problem in distal structures Artem Chernikov David Galvin Sergei Starchenko Fri 02 March 2012
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Valentine Kabanets Russell Impagliazzo Fri 02 March 2012
- Non-Automatizability of Bounded-Depth Frege Proofs Maria Luisa Bonet Carlos Domingo Ricard Gavaldà Alexis Maciel Toniann Pitassi Fri 02 March 2012
- Deterministic polynomial identity testing in non-commutative models Ran Raz Amir Shpilka Fri 02 March 2012
- VPSPACE and a Transfer Theorem over the Reals Pascal Koiran Sylvain Perifel Fri 02 March 2012
- Lower Bounds and Separations for Constant Depth Multilinear Circuits Ran Raz Amir Yehudayoff Fri 02 March 2012
- Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas Meena Mahajan B. V. Raghavendra Rao Fri 02 March 2012
- On the power of unambiguity in log-space A. Pavan Raghunath Tewari N. V. Vinodchandran Fri 02 March 2012
- Equivalence of Polynomial Identity Testing and Polynomial Factorization Swastik Kopparty Shubhangi Saraf Amir Shpilka Fri 02 March 2012
- Unifying Known Lower Bounds via Geometric Complexity Theory Joshua A. Grochow Fri 02 March 2012
- On the hardness of the noncommutative determinant V. Arvind Srikanth Srinivasan Fri 02 March 2012
- Symmetric approximation arguments for monotone lower bounds without sunflowers C. Berg S. Ulfberg Fri 02 March 2012
- A characterization of span program size and improved lower bounds for monotone span programs Ana Gàl Fri 02 March 2012
Library Size: 13G (12949 entries),
Last Updated: Apr 11, 2026, 18:05:34,
Build Time: N/A
