Follow
Pascal Koiran
Pascal Koiran
Professor of Computer Science, Ecole Normale Supérieure de Lyon
Verified email at ens-lyon.fr
Title
Cited by
Cited by
Year
Computability with low-dimensional dynamical systems
P Koiran, M Cosnard, M Garzon
Theoretical Computer Science 132 (1-2), 113-128, 1994
1911994
Arithmetic circuits: The chasm at depth four gets wider
P Koiran
Theoretical Computer Science 448, 56-65, 2012
1562012
Hilbert's Nullstellensatz is in the polynomial hierarchy
P Koiran
Journal of complexity 12 (4), 273-286, 1996
1131996
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
P Koiran, C Moore
Theoretical Computer Science 210 (1), 217-223, 1999
1081999
A weak version of the Blum, Shub, and Smale model
P Koiran
Journal of Computer and System Sciences 54 (1), 177-189, 1997
991997
Neural networks with quadratic VC dimension
P Koiran, ED Sontag
journal of computer and system sciences 54 (1), 190-198, 1997
981997
Computing over the reals with addition and order
P Koiran
Theoretical Computer Science 133 (1), 35-47, 1994
941994
Deciding stability and mortality of piecewise affine dynamical systems
VD Blondel, O Bournez, P Koiran, CH Papadimitriou, JN Tsitsiklis
Theoretical computer science 255 (1-2), 687-696, 2001
922001
Vapnik-Chervonenkis dimension of recurrent neural networks
P Koiran, ED Sontag
Discrete Applied Mathematics 86 (1), 63-79, 1998
881998
Decidable and undecidable problems about quantum automata
VD Blondel, E Jeandel, P Koiran, N Portier
SIAM Journal on Computing 34 (6), 1464-1473, 2005
862005
Quantum automata and algebraic groups
H Derksen, E Jeandel, P Koiran
Journal of Symbolic Computation 39 (3-4), 357-371, 2005
832005
Dynamics of discrete time, continuous state Hopfield networks
P Koiran
Neural Computation 6 (3), 459-468, 1994
821994
The stability of saturated linear dynamical systems is undecidable
VD Blondel, O Bournez, P Koiran, JN Tsitsiklis
Journal of Computer and System Sciences 62 (3), 442-462, 2001
762001
Approximation and learning of convex superpositions
L Gurvits, P Koiran
journal of computer and system sciences 55 (1), 161-170, 1997
731997
A polynomial time algorithm for Diophantine equations in one variable
F Cucker, P Koiran, S Smale
Journal of Symbolic Computation 27 (1), 21-29, 1999
691999
Neural networks with quadratic VC dimension
P Koiran, E Sontag
Advances in neural information processing systems 8, 1995
611995
Shallow circuits with high-powered inputs
P Koiran
arXiv preprint arXiv:1004.4960, 2010
542010
The quantum query complexity of the abelian hidden subgroup problem
P Koiran, V Nesme, N Portier
Theoretical computer science 380 (1-2), 115-126, 2007
53*2007
On the complexity of factoring bivariate supersparse (lacunary) polynomials
E Kaltofen, P Koiran
Proceedings of the 2005 international symposium on Symbolic and algebraic …, 2005
512005
Computing over the reals with addition and order: Higher complexity classes
F Cucker, P Koiran
Journal of Complexity 11 (3), 358-376, 1995
501995
The system can't perform the operation now. Try again later.
Articles 1–20