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
1901994
Arithmetic circuits: The chasm at depth four gets wider
P Koiran
Theoretical Computer Science 448, 56-65, 2012
1582012
Hilbert's Nullstellensatz is in the polynomial hierarchy
P Koiran
Journal of complexity 12 (4), 273-286, 1996
1251996
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
1111999
Neural networks with quadratic VC dimension
P Koiran, ED Sontag
journal of computer and system sciences 54 (1), 190-198, 1997
1041997
A weak version of the Blum, Shub, and Smale model
P Koiran
Journal of Computer and System Sciences 54 (1), 177-189, 1997
1031997
Decidable and undecidable problems about quantum automata
VD Blondel, E Jeandel, P Koiran, N Portier
SIAM Journal on Computing 34 (6), 1464-1473, 2005
962005
Computing over the reals with addition and order
P Koiran
Theoretical Computer Science 133 (1), 35-47, 1994
961994
Vapnik-Chervonenkis dimension of recurrent neural networks
P Koiran, ED Sontag
Discrete Applied Mathematics 86 (1), 63-79, 1998
951998
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
942001
Quantum automata and algebraic groups
H Derksen, E Jeandel, P Koiran
Journal of Symbolic Computation 39 (3-4), 357-371, 2005
902005
Dynamics of discrete time, continuous state Hopfield networks
P Koiran
Neural Computation 6 (3), 459-468, 1994
851994
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
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
761999
Approximation and learning of convex superpositions
L Gurvits, P Koiran
journal of computer and system sciences 55 (1), 161-170, 1997
741997
Neural networks with quadratic VC dimension
P Koiran, E Sontag
Advances in neural information processing systems 8, 1995
631995
Shallow circuits with high-powered inputs
P Koiran
arXiv preprint arXiv:1004.4960, 2010
562010
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
54*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
532005
Randomized and deterministic algorithms for the dimension of algebraic varieties
P Koiran
Proceedings 38th Annual Symposium on Foundations of Computer Science, 36-45, 1997
521997
The system can't perform the operation now. Try again later.
Articles 1–20