1. Recherche
34 résultats  enregistrer la recherche


  • 1
  • 2
...
ensl-00494642v4  Pré-publication, Document de travail
Pascal Koiran. Arithmetic circuits: the chasm at depth four gets wider
2012
...
ensl-00408713v2  Pré-publication, Document de travail
Pascal Koiran. A hitting set construction, with application to arithmetic circuit lower bounds
14 pages. 2009
...
ensl-00477023v4  Pré-publication, Document de travail
Pascal Koiran. Shallow Circuits with High-Powered Inputs
A few typos corrected. 2010
...
hal-00958966v1  Article dans une revue
Pascal Koiran. The topological entropy of iterated piecewise affine maps is uncomputable
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.351-356
...
ensl-00175862v1  Pré-publication, Document de travail
Pascal Koiran, Sylvain Perifel. Interpolation in Valiant's theory
13 pages. 2007
...
ensl-00103018v2  Pré-publication, Document de travail
Pascal Koiran, Sylvain Perifel. VPSPACE and a Transfer Theorem over the Reals
Full version of the paper (appendices of the first version are now included in the text). 2007
...
ensl-00747908v1  Pré-publication, Document de travail
Pascal Koiran, Anastasios Zouzias. Hidden cliques and the certification of the restricted isometry property
2012
...
ensl-00167613v1  Pré-publication, Document de travail
Pascal Koiran, Sylvain Perifel. The Complexity of two Problems on Arithmetic Circuits
16 pages. 2007
...
ensl-00153701v1  Pré-publication, Document de travail
Pascal Koiran, Sylvain Perifel. VPSPACE and a transfer theorem over the complex field
14 pages. 2007
...
hal-00360507v1  Pré-publication, Document de travail
Pascal Koiran, Sylvain Perifel. A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
11 pages. 2009
...
ensl-00232169v1  Pré-publication, Document de travail
Pascal Koiran, Erich Kaltofen. Expressing a Fraction of Two Determinants as a Determinant.
11 pages. 2008
...
ensl-00078110v1  Pré-publication, Document de travail
Sylvain Perifel, Pascal Koiran. Valiant's model: from exponential sums to exponential products
12 pages. 2006
...
ensl-00360974v2  Communication dans un congrès
Irénée Briquel, Pascal Koiran. A Dichotomy Theorem for Polynomial Evaluation
Mathematical Foundations of Computer Science 2009, Aug 2009, Novy Smokovec, Slovakia. Springer, pp.187-198, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-03816-7>
...
ensl-01172296v1  Pré-publication, Document de travail
Ignacio Garcia-Marco, Pascal Koiran. Lower Bounds by Birkhoff Interpolation
2015
...
ensl-00871315v2  Rapport
Pascal Koiran, Natacha Portier, Sébastien Tavenas. On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem
2013, pp.16
...
ensl-00149062v1  Pré-publication, Document de travail
Uffe Flarup, Pascal Koiran, Laurent Lyaudet. On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
14 pages. 2007
...
ensl-01345789v2  Pré-publication, Document de travail
Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte. Reconstruction Algorithms for Sums of Affine Powers
This second version improves on several algorithmic results. 2016
...
hal-01520724v1  Pré-publication, Document de travail
Pascal Koiran, Timothée Pecatte, Ignacio García-Marco. On the linear independence of shifted powers
2017
...
hal-00120934v2  Pré-publication, Document de travail
Pascal Koiran, Vincent Nesme, Natacha Portier. On the Probabilistic Query Complexity of Transitively Symmetric Problems
2006
...
hal-01135558v1  Pré-publication, Document de travail
Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas. Log-concavity and lower bounds for arithmetic circuits
2015
...
hal-01022890v1  Communication dans un congrès
Pascal Koiran, Natacha Portier, Sébastien Tavenas. A Wronskian Approach to the Real τ-Conjecture
MEGA'2013 (Special Issue), Jun 2013, Frankfurt am Main, Allemagne
...
ensl-00440842v3  Communication dans un congrès
Bruno Grenet, Pascal Koiran, Natacha Portier. The Multivariate Resultant is NP-hard in any Characteristic
Petr Hlinený, Antonín Kucera. Mathematical Foundations of Computer Science 2010, Aug 2010, Brno, Czech Republic. Springer-Verlag, 6281, pp.477-488, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-15155-2_42>
ensl-00744385v1  Article dans une revue
Bruno Grenet, Pascal Koiran, Natacha Portier. On the Complexity of the Multivariate Resultant
Journal of Complexity, Elsevier, 2013, 29 (2), p. 142-157. <10.1016/j.jco.2012.10.001>
...
ensl-00175872v1  Pré-publication, Document de travail
Alexander Chistov, Hervé Fournier, Pascal Koiran, Sylvain Perifel. On the construction of a family of transversal subspaces over finite fields
14 pages. 2007
...
ensl-00153736v1  Pré-publication, Document de travail
Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé. Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
13 pages. 2007
...
hal-00573631v1  Communication dans un congrès
Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier. Symmetric Determinantal Representation of Weakly-Skew Circuits
Thomas Schwentick and Christoph Dürr. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 9, pp.543-554, 2011, Leibniz International Proceedings in Informatics (LIPIcs). <10.4230/LIPIcs.STACS.2011.543>
...
ensl-00260279v2  Communication dans un congrès
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao. Adversary lower bounds for nonadaptive quantum algorithms
WoLLIC 2008 15th Workshop on Logic, Language, Information and Computation, Jul 2008, Edinburgh, United Kingdom. Springer, 2008, LNCS series (FoLLI-LNAI subseries)
ensl-00607154v1  Communication dans un congrès
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki. The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
Supratik Chakraborty and Amir Kumar. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Dec 2011, Mumbai, India. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 13, pp.16, 2011, Leibniz International Proceedings in Informatics. <10.4230/LIPIcs.FSTTCS.2011.127>
...
ensl-01345746v2  Pré-publication, Document de travail
Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé. On the complexity of partial derivatives
2016
  • 1
  • 2

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD