A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Majorizing estimators and the approximation of #P-complete problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating permanents of complex matrices
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Clifford algebras and approximating the permanent
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Alternative Algorithms for Counting All Matchings in Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Clifford algebras and approximating the permanent
Journal of Computer and System Sciences - STOC 2002
A determinant-based algorithm for counting perfect matchings in a general graph
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Non-commutative circuits and the sum-of-squares problem
Proceedings of the forty-second ACM symposium on Theory of computing
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
Almost settling the hardness of noncommutative determinant
Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximate counting of cycles in streams
ESA'11 Proceedings of the 19th European conference on Algorithms
On the complexity of mixed discriminants and related problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An almost linear time approximation algorithm for the permanent of a random (0-1) matrix
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximating the Permanent via Nonabelian Determinants
SIAM Journal on Computing
Noncommutativity makes determinants hard
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |