Ariel Waissbein
Ariel Waissbein has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Guillermo Matera
National Council of Science and Technology (CONICET), Buenos Aires, Argentina
4 shared publications - Gabriela Jeronimo
Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
2 shared publications - Pablo Solernó
Departamento de Matemática and IMAS Facultad de Ciencias Exactas y Naturales UBA-CONICET Universidad de Buenos Aires Ciudad Universitaria 1428 Buenos Aires Argentina
2 shared publications - Antonio Cafure
Universidad de Buenos Aires
1 shared publication - Ezequiel Dratman
Instituto de Ciencia. Universidad Nacional de General Sarmiento. Argentina
1 shared publication
Latest Publications
- 24 April 2009
- Published by Springer Nature in computational complexity
- Vol. 18 (1) , 105-154
Robust Algorithms For Generalized Pham Systems
- 24 April 2009
- Published by Springer Nature in computational complexity
- Vol. 18 (1) , 105-154
Robust Algorithms For Generalized Pham Systems
- 22 February 2008
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 9 (1) , 1-50
Deformation Techniques for Sparse Systems
- 22 February 2008
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 9 (1) , 1-50
Deformation Techniques for Sparse Systems
- 1 January 2008
- Published by Springer Nature
- p. 55-77
Efficient Inversion of Rational Maps Over Finite Fields
- 1 January 2008
- Published by Springer Nature
- p. 55-77
Efficient Inversion of Rational Maps Over Finite Fields
- Open Access
Deformation techniques for sparse systems
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation of Huber and Sturmfels. The complexity of our algorithm is quadratic in the size of the combinatorial structure of the input system. This size is mainly represented by the mixed volume of Newton polytopes of the input polynomials and an arithmetic analogue of the mixed volume associated to the deformations under consideration.
Open AccessDeformation techniques for sparse systems
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation of Huber and Sturmfels. The complexity of our algorithm is quadratic in the size of the combinatorial structure of the input system. This size is mainly represented by the mixed volume of Newton polytopes of the input polynomials and an arithmetic analogue of the mixed volume associated to the deformations under consideration.