Filtrer vos résultats
- 34
- 13
- 17
- 15
- 13
- 1
- 1
- 46
- 7
- 1
- 2
- 1
- 1
- 3
- 3
- 1
- 6
- 2
- 3
- 1
- 3
- 2
- 3
- 3
- 7
- 2
- 3
- 1
- 46
- 1
- 44
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 47
- 10
- 7
- 7
- 6
- 6
- 6
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
47 résultats
|
|
|
triés par
|
|
|
Finding a Vector Orthogonal to Roughly Half a Collection of VectorsJournal of Complexity, 2008, 24, pp.39-53. ⟨10.1016/j.jco.2006.09.005⟩
Article dans une revue
lirmm-00292703v1
|
||
|
|
Adversary lower bounds for nonadaptive quantum algorithmsWoLLIC 2008 15th Workshop on Logic, Language, Information and Computation, Jul 2008, Edinburgh, United Kingdom
Communication dans un congrès
ensl-00260279v2
|
||
The stability of saturated linear dynamical systems is undecidable17th International Symposium on Theoretical Aspects of Computer Science - STACS'2000, LIFL, 2000, Lille, France, pp.479-490
Communication dans un congrès
inria-00099336v1
|
|||
|
|
A tau-conjecture for Newton polygons2014, pp.14
Rapport
ensl-00850791v2
|
||
|
|
Valiant's model: from exponential sums to exponential products2006
Pré-publication, Document de travail
ensl-00078110v1
|
||
|
|
Finding a Vector Orthogonal to Roughly Half a Collection of Vectors2007
Pré-publication, Document de travail
ensl-00153736v1
|
||
|
|
The Complexity of two Problems on Arithmetic Circuits2007
Pré-publication, Document de travail
ensl-00167613v1
|
||
Log-Concavity and Lower Bounds for Arithmetic CircuitsMathematical Foundations of Computer Science (MFCS), 2015, Milan, Italy. pp.361-371
Communication dans un congrès
ensl-01991239v1
|
|||
A tau-Conjecture for Newton PolygonsFoundations of Computational Mathematics, 2015, 15 (1), pp.185-197
Article dans une revue
hal-01990308v1
|
|||
|
|
Reconstruction Algorithms for Sums of Affine PowersInternational Symposium on Symbolic and Algebraic Computation (ISSAC), Jul 2017, Kaiserslautern, Germany
Communication dans un congrès
ensl-01345789v3
|
||
|
|
Shallow Circuits with High-Powered Inputs2010
Pré-publication, Document de travail
ensl-00477023v4
|
||
|
|
Factoring bivariate lacunary polynomials without heights38th International Symposium on Symbolic and Algebraic Computation, ACM, Boston, United States. p 141-148, ⟨10.1145/2465506.2465932⟩
Communication dans un congrès
ensl-00738542v1
|
||
|
|
Lower Bounds by Birkhoff InterpolationJournal of Complexity, 2017
Article dans une revue
ensl-01172296v1
|
||
|
|
Root Separation for TrinomialsJournal of Symbolic Computation, In press
Article dans une revue
ensl-01585049v3
|
||
|
|
On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theoremDiscrete and Computational Geometry, 2015, pp.16
Article dans une revue
ensl-00871315v2
|
||
|
|
On the complexity of partial derivatives2016
Pré-publication, Document de travail
ensl-01345746v2
|
||
|
|
The Multivariate Resultant is NP-hard in any CharacteristicMathematical Foundations of Computer Science 2010, Aug 2010, Brno, Czech Republic. pp.477-488, ⟨10.1007/978-3-642-15155-2_42⟩
Communication dans un congrès
ensl-00440842v3
|
||
|
|
Symmetric Determinantal Representation of Formulas and Weakly Skew CircuitsLeonid Gurvits, Philippe Pebay, J. Maurice Rojas, David Thompson. Randomization, Relaxation, and Complexity in Polynomial Equation Solving, Amer. Math. Soc., pp.61-96, 2011, Contemporary Mathematics, 978-0-8218-5228-6. ⟨10.1090/conm/556⟩
Chapitre d'ouvrage
ensl-00504925v4
|
||
The stability of saturated linear dynamical systems is undecidableJournal of Computer and System Sciences, 2001, 62 (3), pp.442-462
Article dans une revue
inria-00100924v1
|
|||
|
|
A Dichotomy Theorem for Polynomial EvaluationMathematical Foundations of Computer Science 2009, Aug 2009, Novy Smokovec, Slovakia. pp.187-198, ⟨10.1007/978-3-642-03816-7⟩
Communication dans un congrès
ensl-00360974v2
|
||
|
|
Intersection multiplicity of a sparse curve and a low-degree curveJournal of Pure and Applied Algebra, 2020, 224 (7), pp.106279. ⟨10.1016/j.jpaa.2019.106279⟩
Article dans une revue
hal-02502580v1
|
||
|
|
Hidden cliques and the certification of the restricted isometry propertyIEEE Transactions on Information Theory, 2014, 60 (8), pp.4999-5007
Article dans une revue
ensl-00747908v1
|
||
|
|
VPSPACE and a transfer theorem over the complex field2007
Pré-publication, Document de travail
ensl-00153701v1
|
||
|
|
Symmetric Determinantal Representation of Weakly-Skew CircuitsSymposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.543-554, ⟨10.4230/LIPIcs.STACS.2011.543⟩
Communication dans un congrès
hal-00573631v1
|
||
|
|
The topological entropy of iterated piecewise affine maps is uncomputableDiscrete Mathematics and Theoretical Computer Science, 2001, Vol. 4 no. 2 (2), pp.351-356. ⟨10.46298/dmtcs.292⟩
Article dans une revue
hal-00958966v1
|
||
|
|
Derandomization and absolute reconstruction for sums of powers of linear formsTheoretical Computer Science, 2021, 887, pp.63-84. ⟨10.1016/j.tcs.2021.07.005⟩
Article dans une revue
hal-03457373v1
|
||
|
|
On the Probabilistic Query Complexity of Transitively Symmetric Problems2006
Pré-publication, Document de travail
hal-00120934v2
|
||
|
|
On the linear independence of shifted powersJournal of Complexity, 2018, 45, pp.67-82
Article dans une revue
hal-01520724v2
|
||
|
|
Deciding stability and mortality of piecewise affine dynamical systemsTheoretical Computer Science, 2001, 255 (1-2), pp.687-696. ⟨10.1016/S0304-3975(00)00399-6⟩
Article dans une revue
inria-00100820v1
|
||
|
|
Interpolation in Valiant's theory2007
Pré-publication, Document de travail
ensl-00175862v1
|
- 1
- 2