Exponential space computation of Gröbner bases
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
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
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Gröbner bases for polynomial systems with parameters
Journal of Symbolic Computation
Model checking in the modal µ-calculus and generic solutions
Journal of Symbolic Computation
Lower complexity bounds for interpolation algorithms
Journal of Complexity
Valiant's model: from exponential sums to exponential products
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Software Engineering and complexity in effective Algebraic Geometry
Journal of Complexity
On the complexity of the multivariate resultant
Journal of Complexity
An Arithmetic Poisson Formula for the multi-variate resultant
Journal of Complexity
| Hi-index | 0.00 |