Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Monte-Carlo algorithm for estimating the permanent
SIAM Journal on Computing
Rounding Errors in Algebraic Processes
Rounding Errors in Algebraic Processes
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
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
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the hardness of approximating the permanent of structured matrices
Computational Complexity
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
Proportional response dynamics leads to market equilibrium
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Regularization on Graphs with Function-adapted Diffusion Processes
The Journal of Machine Learning Research
Proceedings of the 20th international conference on World wide web
On the complexity of mixed discriminants and related problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |