31 citations · 78 across the 16 of their papers we have counts for
5 papers · 1 filter
A Kronecker algorithm for locally closed sets over a perfect field
Nardo Giménez, Joos Heintz, Guillermo Matera +3
We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety defined over a perf…
Quiz Games as a model for Information Hiding
Bernd Bank, Joos Heintz, Guillermo Matera +3
We present a general computation model inspired in the notion of information hiding in software engineering. This model has the form of a game which we call quiz game. It allows in…
Degeneracy loci and polynomial equation solving
Bernd Bank, Marc Giusti, Joos Heintz +3
Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers and let be a -matrix of coordinate functions of , where $s…
On the geometry of polar varieties
B. Bank, M. Giusti, J. Heintz +2
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehens…
Polar Varieties and Efficient Real Elimination
B. Bank, M. Giusti, J. Heintz +1
Let be a smooth and compact real variety given by a reduced regular sequence of polynomials . This paper is devoted to the algorithmic problem of finding {\em…