Random generation of combinatorial structures from a uniform
Theoretical Computer Science
SIAM Journal on Computing
Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
Polytopes, permanents and graphs with large factors
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Markov chains and polynomial time algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Random walks on the vertices of transportation polytopes with constant number of sources
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Generating Partial and Multiple Transversals of a Hypergraph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Efficiently Approximating Weighted Sums with Exponentially Many Terms
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Approximate counting by dynamic programming
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
The evolutionary capacity of protein structures
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
On approximating weighted sums with exponentially many terms
Journal of Computer and System Sciences
Compression of samplable sources
Computational Complexity
Journal of Combinatorial Theory Series A
Every Linear Threshold Function has a Low-Weight Approximator
Computational Complexity
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
On the hardness of counting and sampling center strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the Hardness of Counting and Sampling Center Strings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We solve an open problem concerning the mixing time of symmetric random walk on the n-dimensional cube truncated by a hyperplane, showing that it is polynomial in n. As a consequence, we obtain a fully-polynomial randomized approximation scheme for counting the feasible solutions of a 0-1 knapsack problem. The key ingredient in our analysis is a combinatorial construction we call a "balanced almost uniform permutation," which seems to be of independent interest.