Computer Algebra: Past and Future
Journal of Symbolic Computation
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Complexity of factoring and calculating the GCD of linear ordinary differential operators
Journal of Symbolic Computation
The complexity of deciding consistency of systems of polynomials in exponent inequalities
Journal of Symbolic Computation
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A new algebraic method for robot motion planning and real geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Accurate low-rank matrix recovery from a small number of linear measurements
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
The minimum-rank gram matrix completion via modified fixed point continuation method
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A Simpler Approach to Matrix Completion
The Journal of Machine Learning Research
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
SIAM Journal on Matrix Analysis and Applications
Robust multivariate autoregression for anomaly detection in dynamic product ratings
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.00 |