arXiv 2002-05-21 EN Parameterized Intractability of Motif Search Problems Fellows, Michael R. · Gramm, Jens · Niedermeier, Rolf
arXiv 2002-05-04 EN PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation Hearn, Robert A. · Demaine, Erik D.
arXiv 2002-04-16 EN Kolmogorov's Structure Functions and Model Selection Vereshchagin, Nikolai · Vitanyi, Paul
arXiv 2002-04-10 EN The Geometric Maximum Traveling Salesman Problem Barvinok, Alexander · Fekete, Sandor P. · Johnson, David S. · Tamir, Arie +2
arXiv 2002-04-04 EN New Results on Monotone Dualization and Generating Hypergraph Transversals Eiter, Thomas · Gottlob, Georg · Makino, Kazuhisa
arXiv 2002-02-25 EN Equivalence and Isomorphism for Boolean Constraint Satisfaction Boehler, E. · Hemaspaandra, E. · Reith, Steffen · Vollmer, Heribert
arXiv 2002-01-09 EN On the Importance of Having an Identity or, is Consensus really Universal? Buhrman, Harry · Panconesi, Alessandro · Silvestri, Riccardo · Vitanyi, Paul
arXiv 2001-12-03 EN Program schemes with binary write-once arrays and the complexity classes they capture Stewart, Iain A.
arXiv 2001-11-29 EN One-way communication complexity and the Neciporuk lower bound on formula size Klauck, Hartmut
arXiv 2001-11-21 EN Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial Rothe, Jörg
arXiv 2001-11-06 EN On the complexity of inducing categorical and quantitative association rules Angiulli, Fabrizio · Ianni, Giovambattista · Palopoli, Luigi
