234 search results - page 4 / 47 » On the relative complexity of approximate counting problems |
174
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
164
click to vote
TAMC
2009
Springer
16 years 6 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
159
click to vote
COMPGEOM
2009
ACM
16 years 5 days ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
146
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
163
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...