Andres Rojas Paredes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Andres Rojas Paredes has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Bart Kuijpers
Databases and Theoretical Computer Science Group, Data Science Institute (DSI), Hasselt University and Transnational University Limburg, 3500 Hasselt, Belgium
2 shared publications - Joos Heintz
Departamento de Computación Universidad de Buenos Aires and CONICET Ciudad Univ., Pab.I 1428 Buenos Aires Argentina
2 shared publications - Bernd Bank
Humboldt-Universität zu Berlin
1 shared publication - Guillermo Matera
National Council of Science and Technology (CONICET), Buenos Aires, Argentina
1 shared publication - Joos Heintz
Departamento de Computación, Universidad de Buenos Aires, Ciudad Universitaria, Pab. I, 1428 Buenos Aires, Argentina
1 shared publication - José Luis Montaña
Department of Mathematics, Statistics and Computer Science, Universidad de Cantabria, Santander, Spain
1 shared publication
Latest Publications
- 1 June 2016
- Published by Elsevier in Journal of Complexity
- Vol. 34, 1-29
Quiz games as a model for information hiding
- 1 June 2016
- Published by Elsevier in Journal of Complexity
- Vol. 34, 1-29
Quiz games as a model for information hiding
- Open Access
- 4 May 2012
- Published by Elsevier in Journal of Complexity
- Vol. 29 (1) , 92-138
Software Engineering and complexity in effective Algebraic Geometry
- 4 May 2012
- Published by Elsevier in Journal of Complexity
- Vol. 29 (1) , 92-138
Open AccessSoftware Engineering and complexity in effective Algebraic Geometry
- Open Access
On the intrinsic complexity of elimination problems in effective Algebraic Geometry
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model.
Open AccessOn the intrinsic complexity of elimination problems in effective Algebraic Geometry
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model.