35 search results - page 1 / 7 » Pseudorandomness for Approximate Counting and Sampling |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
FOCS
1996
IEEE
13 years 8 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
AAAI
2007
13 years 7 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
CSE
2008
IEEE
13 years 4 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
CP
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...