- Probabilits et applications transcrit par Emmanuel Hainry
- On the Complexity of Factoring Bivariate Supersparse (Lacunary) Polynomials*
- Straight-Line Computations over Semirings Loick Magnin
- Laboratoire de l'Informatique du Par all elisme
- A New Incremental Learning Technique 1
- LA LIMITE DES THEORIES DE COURBES GENERIQUES
- Approximating the Volume of Definable Sets Pascal Koiran \Lambda
- Laboratoire de l'Informatique du Parall elisme Ecole Normale Superieure de Lyon
- VPSPACE and a Transfer Theorem over the Reals
- Adversary lower bounds for nonadaptive quantum algorithms
- On real Turing machines that toss coins Felipe Cucker 1
- Laboratoire de l'Informatique du Par all elisme
- The stability of saturated linear dynamical systems is undecidable
- Laboratoire de l'Informatique du Par all elisme
- Habilitation diriger des recherches soutenue par
- Saturation and Stability in the Theory of Computation over the Reals
- DIMACS Technical Report 9625 Closedform Analytic Maps in One and Two
- Quelques proprits des fonctions globales d'automates cellulaires
- Laboratoire de l'Informatique du Par all elisme
- pr'esent'ee par Pascal Koiran
- Elimination des quanti cateurs en langage ni Vincent Clapi es
- DIMACS Technical Report 9624 Elimination of Constants from Machines over
- Laboratoire de l'Informatique du Paralllisme cole Normale Suprieure de Lyon
- On the expressive power of CNF formulas of bounded Tree-and Clique-Width
- A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
- Journal of Symbolic Computation 39 (2005) 357371 www.elsevier.com/locate/jsc
- Expressing a Fraction of Two Determinants as a Determinant*
- A Dichotomy Theorem for Polynomial Irenee Briquel and Pascal Koiran
- VPSPACE and a transfer theorem over the complex field Pascal Koiran and Sylvain Perifel
- On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
- Michael F. Cowlishaw, Eric M. Schwarz, Ronald M. Smith, Charles F. Webb, A decimal oating-point specication
- SIAM J. COMPUT. Vol. 12, No. 4, November 1983
- Report on: Efficient Parallel Evaluation of Straight-line Code and Arithmetic Circuits
- Rapport: Cook's versus Valiant's Hypothesis, Peter Brgisser 17 novembre 2006
- rapport : Two Algorithmic Results for the Traveling Salesman Problem
- Problmes d'valuation et dnombrement sur Thibaut Balabonski
- Mthode Combinatoire pour le Calcul du Pfaen Romain Demangeon
- THE COMPLEXITY OF PLANAR COUNTING PROBLEMS ARTICLE : HARRY B. HUNT III, MADHAV V. MARATHE,
- Finding Small Degree Factors of Multivariate Supersparse (Lacunary) Polynomials Over Algebraic Number Fields*
- Laboratoire de l'Informatique du Par all elisme
- presentee devant L'UNIVERSIT CLAUDE BERNARD LYON
- Presentation de l'article : ARITHMETIZATION
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- Laboratoire de l'Informatique du Par all elisme
- On the construction of a family of transversal subspaces over finite fields
- VC Dimension in Circuit Complexity Pascal Koiran
- Pavages dyadiques alatoires du carr unit Sylvain Perifel
- Laboratoire de l'Informatique du Par all elisme
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- INTERPOLATION IN VALIANT'S THEORY Pascal Koiran and Sylvain Perifel
- Complexity and Dimension Felipe Cucker
- Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties \Lambda
- Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common
- Neural Networks with Quadratic VC Dimension 1
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
- A Rank Theorem for Vandermonde Matrices Pascal Koiran, Natacha Portier and Gilles Villard #
- Laboratoire de l'Informatique du Par all elisme
- VPSPACE AND A TRANSFER THEOREM OVER THE REALS
- On De ning Irreducibility Pascal Koiran
- DIMACS Technical Report 9656 December 1996
- A Quantum Lower Bound for the Query Complexity of Simon's Problem
- Laboratoire de l'Informatique du Par all elisme
- DIMACS Technical Report 9627 Hilbert's Nullstellensatz is in the Polynomial
- Erratum to ``Elimination of Constants from Machines over Algebraically Closed Fields''
- On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
- comput. complex. 13 (2004), 131 146 1016-3328/04/03013116
- Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
- Rapport : "A lower bound for monotone arithmetic circuits computing 0-1 permanent"
- Rapport : A quadratic bound for the determinant and permanent problem.
- Circuits versus Trees in Algebraic Complexity Pascal Koiran
- Laboratoire de l'Informatique du Par all elisme
- Techniques in Neural Learning Pascal Koiran
- Hilbert's Nullstellensatz is in the Polynomial Hierarchy
- Laboratoire de l'Informatique du Parallelisme Ecole Normale Sup'erieure de Lyon
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- Adversary Lower Bounds for Nonadaptive Quantum Algorithms
- Laboratoire de l'Informatique du Paralllisme Ecole Normale Suprieure de Lyon
- On the expressive power of CNF formulas of bounded Tree-and Clique-Width
- Classes de Valiant dans le cas non-associatif Florent Capelli
- Construction d'une structure o P = NP Martin Bodin
- Algebraic settings for the problem "P = NP?" Rapport par Hugo Labrande
- Two algorithmic results for the Travelling Salesman Rapport par Vors Guillaume
