31 citations · 78 across the 16 of their papers we have counts for
18 papers
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…
An unfeasability view of neural network learning
Joos Heintz, Hvara Ocar, Luis Miguel Pardo +2
We define the notion of a continuously differentiable perfect learning algorithm for multilayer neural network architectures and show that such algorithms don't exist provided that…
On Bezout Inequalities for non-homogeneous Polynomial Ideals
Amir Hashemi, Joos Heintz, Luis Miguel Pardo +1
We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic Bézout Inequalities for the sum of two ideals in terms of t…
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…
Intrinsic complexity estimates in polynomial optimization
Bernd Bank, Marc Giusti, Joos Heintz +1
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using ar…