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
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
STOC '01 Proceedings of the thirty-third 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
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Alternative Algorithms for Counting All Matchings in Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
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
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Classical complexity and quantum entanglement
Journal of Computer and System Sciences - Special issue: STOC 2003
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast approximation of the permanent for very dense problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Solution counting algorithms for constraint-centered search heuristics
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Non-commutative circuits and the sum-of-squares problem
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
On the complexity of mixed discriminants and related problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of 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 |