Sciweavers

2957 search results - page 117 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
APPROX
2000
Springer
84views Algorithms» more  APPROX 2000»
14 years 2 months ago
On the relative complexity of approximate counting problems
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
COCOON
1999
Springer
14 years 2 months ago
On the Complexity of Approximating Colored-Graph Problems
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of the Approximation of the Bandwidth Problem
d Abstract) Walter Unger Lehrstuhl f
Walter Unger
DCC
1993
IEEE
14 years 2 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
COMPGEOM
2006
ACM
14 years 1 months ago
The effect of corners on the complexity of approximate range searching
Sunil Arya, Theocharis Malamatos, David M. Mount