Approximating permanents of complex matrices

Authors:
Martin Fürer
Affiliations:
Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Citing 5
Cited 0

How hard is it to marry at random? (On the approximation of the permanent)

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Approximating the permanent

SIAM Journal on Computing
A Monte-Carlo algorithm for estimating the permanent

SIAM Journal on Computing
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract