arXiv 2002-10-21 EN Tetris is Hard, Even to Approximate Demaine, Erik D. · Hohenberger, Susan · Liben-Nowell, David
arXiv 2002-10-11 EN On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata Makatchev, Maxim
arXiv 2002-08-29 EN Gales and supergales are equivalent for defining constructive Hausdorff dimension Fenner, Stephen A.
arXiv 2002-08-08 EN A note on fractional derivative modeling of broadband frequency-dependent absorption: Model III Chen, W.
arXiv 2002-08-05 EN Rectangle Size Bounds and Threshold Covers in Communication Complexity Klauck, Hartmut
arXiv 2002-07-25 EN Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems Besnard, Philippe · Schaub, Torsten · Tompits, Hans · Woltran, Stefan
arXiv 2002-07-20 EN Complexity of Nested Circumscription and Nested Abnormality Theories Cadoli, Marco · Eiter, Thomas · Gottlob, Georg
arXiv 2002-07-03 EN Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications Grolmusz, Vince
arXiv 2002-05-29 EN Vote Elicitation: Complexity and Strategy-Proofness Conitzer, Vincent · Sandholm, Tuomas
