20 citations · 39 across the 8 of their papers we have counts for
9 papers
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…
A promenade through Correct Test Sequences I: Degree of constructible sets, Bézout's Inequality and density
Luis Miguel Pardo, Daniel Sebastián
In Heintz-Schnorr (1982), the authors introduced the notion of correct test sequence and since then it has been widely used to design probabilistic algorithms for Polynomial Equali…
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…
On the uniform distribution of rational inputs with respect to condition numbers of Numerical Analysis
D. Castro, J. L. Montana, L. M. Pardo +1
We show that rational data of bounded input length are uniformly distributed with respect to condition numbers of numerical analysis. We deal both with condition numbers of Linear…
Sharp estimates for the arithmetic Nullstellensatz
Teresa Krick, Luis Miguel Pardo, Martin Sombra
We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over . The result improves previous work of Philippon, Berenstein-Yger and Kr…