Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Arithmetic with real algebraic numbers is in NC
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On computing determinants of matrices without divisions
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Lower bounds on testing membership to a polyhedron by algebraic decision trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing the complexification of a semi-algebraic set
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
A combinatorial algorithm for the determinant
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Almost settling the hardness of noncommutative determinant
Proceedings of the forty-third annual ACM symposium on Theory of computing
Computations in modules over commutative domains
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
| Hi-index | 0.00 |