arXiv 2005-08-05 EN A Universal Scaling Theory for Complexity of Analog Computation Avizrats, Yaniv S. · Feinberg, Joshua · Fishman, Shmuel
arXiv 2005-04-04 EN Clustering of solutions in the random satisfiability problem Mezard, M. · Mora, T. · Zecchina, R.
arXiv 2005-02-18 EN Semantical Characterizations and Complexity of Equivalences in Answer Set Programming Eiter, Thomas · Fink, Michael · Woltran, Stefan
arXiv 2005-02-08 EN Logarithmic Lower Bounds in the Cell-Probe Model Patrascu, Mihai · Demaine, Erik D.
arXiv 2005-02-08 EN The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties Buergisser, Peter · Lotz, Martin
arXiv 2005-01-26 EN Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients Mulmuley, Ketan D. · Sohoni, Milind
arXiv 2005-01-25 EN Optimal Union-Find in Constraint Handling Rules Schrijvers, Tom · Fruehwirth, Thom
arXiv 2005-01-25 EN Simple extractors via constructions of cryptographic pseudo-random generators Zimand, Marius
arXiv 2005-01-11 EN Algebraic Properties for Selector Functions Hemaspaandra, Lane A. · Hempel, Harald · Nickelsen, Arfst
arXiv 2005-01-05 EN On The Liniar Time Complexity of Finite Languages Moscu, Mircea Alexandru Popescu
arXiv 2004-12-11 EN On computing fixed points for generalized sandpiles Formenti, Enrico · Masson, Benoit
arXiv 2004-12-10 EN The approximability of three-valued MAX CSP Jonsson, Peter · Klasson, Mikael · Krokhin, Andrei
arXiv 2004-12-03 EN Signals for Cellular Automata in dimension 2 or higher Dubacq, Jean-Christophe · Terrier, Veronique
