234 search results - page 1 / 47 » On the relative complexity of approximate counting problems |
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
ALGOSENSORS
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
STACS
2010
Springer
14 years 8 days ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...