Sciweavers

1941 search results - page 12 / 389
» On the Hardness of Approximate Reasoning
Sort
View
PERCOM
2006
ACM
15 years 3 months ago
Hardness and approximation of Gathering in static radio networks
Jean-Claude Bermond, Nelson Morales, Stépha...
56
Voted
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Hardness and Approximation of Octilinear Steiner Trees
Matthias Müller-Hannemann, Anna Schulze
82
Voted
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
COCOON
2003
Springer
15 years 2 months ago
Tetris is Hard, Even to Approximate
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurat...
Erik D. Demaine, Susan Hohenberger, David Liben-No...