Clifford algebras and approximating the permanent

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 222-231

  Chien, Steve ^a   Rasmussen, Lars ^a   Sinclair, Alistair ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

CLIFFORD ALGEBRAS; FULLY-POLYNOMIAL RANDOMIZED APPROXIMATION SCHEME;

ALGORITHMS;

EID: 0036039331     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509944     Document Type: Conference Paper

References (20)

1. Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor
2. New permanent estimators via non-commutative determinants
3. How hard is it to marry at random? (on the approximation of the permanent)
4. On the matching polynomial of a graph
5. An analysis of a Monte Carlo algorithm for approximating the permanent
6. Approximating the permanent
7. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
8. A mildly exponential approximation algorithm for the permanent
9. A Monte-Carlo algorithm for estimating the permanent
10. Approximating the number of dimer coverings of a lattice
11. The algebraic theory of quadratic forms
12. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
13. Permanents
14. Lower bounds for non-commutative computation
15. Approximating the permanent: A simple approach
16. On approximating the permanent and other #P-complete problems
17. The complexity of computing the permanent