Abstract:
Abstract. In this paper we present the research that has been done with Linear Dynamical Systems to generate almost uniformly elements from a given set, and thus approximate some hard counting problems. We also indicate how non-linear systems can help to parallelize the computation. Finally we outline possible applications of linear systems to formalize heuristics. 1.
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1633
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1321
|
Randomized Algorithms
– Motwani, Raghavan
- 1995
|
|
363
|
Spectral Graph Theory
– Chung
|
|
333
|
The complexity of computing the permanent
– Valiant
- 1979
|
|
220
|
Approximating the permanent
– Jerrum, Sinclair
- 1989
|
|
209
|
Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science
– Jerrum, Valiant, et al.
- 1986
|
|
166
|
Lectures on the coupling method
– Lindvall
- 2002
|
|
161
|
The Markov chain Monte Carlo method: an approach to approximate counting and integration in Approximation Algorithms for NP-hard Problems
– Jerrum, Sinclair
- 1996
|
|
147
|
Algorithms for Random Generation & Counting: A Markov Chain Approach
– Sinclair
- 1993
|
|
79
|
Generating random spanning trees
– Broder
- 1989
|
|
73
|
Monte-Carlo approximation algorithms for enumeration problems
– Karp, Luby, et al.
- 1989
|
|
49
|
Markov chains and polynomial time algorithms
– Kannan
- 1994
|
|
37
|
Simulated annealing for graph bisection
– Jerrum, Sorkin
- 1993
|
|
37
|
The time complexity of maximum matching by simulated annealing
– Sasaki, Hajek
- 1988
|
|
27
|
Quadratic dynamical systems
– Rabinovich, Sinclair, et al.
- 1992
|
|
19
|
A computational view of population genetics
– Rabani, Rabinovich, et al.
- 1995
|
|
17
|
Rapidly mixing Markov chains
– Vazirani
- 1991
|
|
16
|
Markov Chains (Cambridge
– Norris
- 1997
|
|
13
|
Simulating quadratic dynamical systems is PSPACE-complete
– Arora, Rabani, et al.
- 1994
|
|
9
|
Complexity Theory and Genetics
– Pudl'ak
- 1994
|
|
8
|
How hard is to marry at random
– Broder
- 1986
|
|
7
|
Independent sets versus perfect matchings
– Teng
- 1995
|
|
3
|
Coloring in sublinear time
– Nolte, Schrader
- 1997
|
|
2
|
On the greedy algorithm for satisfiability
– Koutsupias, Papadimitriu
- 1992
|
|
1
|
Basic in Blax-box Combinatorial Optimization
– Juels
- 1990
|
|
1
|
The complexity of enumerationand reability problems
– Valiant
- 1979
|
|
