Filtrer vos résultats
- 18
- 6
- 1
- 11
- 10
- 3
- 1
- 24
- 5
- 1
- 2
- 1
- 2
- 1
- 2
- 6
- 7
- 2
- 1
- 24
- 1
- 12
- 8
- 5
- 3
- 2
- 2
- 1
- 1
- 25
- 7
- 5
- 5
- 5
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
25 résultats
|
|
|
triés par
|
|
|
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplicationJun 2022, Rome, Italy. pp.416-425, ⟨10.1145/3519935.3520044⟩
Communication dans un congrès
hal-03761732v1
|
||
|
|
On the Sensitivity Conjecture for Read-k Formulas41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Aug 2016, Krakow, Poland. ⟨10.4230/LIPIcs.MFCS.2016.16⟩
Communication dans un congrès
hal-02447411v1
|
||
VNP = VP in the multilinear worldInformation Processing Letters, 2016, 116 (2), pp.179-182
Article dans une revue
hal-01995396v1
|
|||
|
|
On the Markov numbers: fixed numerator, denominator, and sum conjecturesAdvances in Applied Mathematics, 2021, 130, pp.102227
Article dans une revue
hal-03013363v1
|
||
|
|
Detecting wheelsApplicable Analysis and Discrete Mathematics, 2014, 8 (1), ⟨10.2298/AADM131128023D⟩
Article dans une revue
hal-01230785v1
|
||
|
|
Towards Optimal Depth-Reductions for Algebraic Formulas38th Computational Complexity Conference (CCC 2023), Jul 2023, Warwick, United Kingdom. pp. 28:1-28:19, ⟨10.4230/LIPIcs.CCC.2023.28⟩
Communication dans un congrès
hal-03988106v2
|
||
|
|
A Wronskian Approach to the Real τ-ConjectureMEGA'2013 (Special Issue), Jun 2013, Frankfurt am Main, Allemagne
Communication dans un congrès
hal-01022890v1
|
||
A Wronskian approach to the real τ-conjectureJournal of Symbolic Computation, 2015, 68, pp.195-214
Article dans une revue
ensl-01991276v1
|
|||
|
|
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Jul 2016, Rome, Italy. ⟨10.4230/LIPIcs.ICALP.2016.33⟩
Communication dans un congrès
hal-02447429v1
|
||
|
|
Nonnegative rank measures and monotone algebraic branching programsFSTTCS, Dec 2019, Mumbai, India. pp.15:1--15:14
Communication dans un congrès
hal-02404630v1
|
||
|
|
Reconstruction of Full Rank Algebraic Branching Programs32nd Computational Complexity Conference (CCC 2017), Jul 2017, Riga, Latvia. pp.1 - 21, ⟨10.4230/LIPIcs.CCC.2017.21⟩
Communication dans un congrès
hal-02447472v1
|
||
|
|
Building Efficient and Compact Data Structures for Simplicial ComplexesInternational Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. ⟨10.4230/LIPIcs.SOCG.2015.642⟩
Communication dans un congrès
hal-01145407v1
|
||
|
|
Building Efficient and Compact Data Structures for Simplicial ComplexeAlgorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩
Article dans une revue
hal-01364648v1
|
||
|
|
Reconstruction of Full Rank Algebraic Branching ProgramsACM Transactions on Computation Theory, 2019, 11 (1), pp.1-56. ⟨10.1145/3282427⟩
Article dans une revue
hal-02408621v1
|
||
|
|
Log-concavity and lower bounds for arithmetic circuits2015
Pré-publication, Document de travail
hal-01135558v1
|
||
|
|
A tau-conjecture for Newton polygons2014, pp.14
Rapport
ensl-00850791v2
|
||
|
|
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials2022
Pré-publication, Document de travail
hal-03761743v1
|
||
Improved bounds for reduction to depth 4 and depth 3Information and Computation, 2015, 240, pp.2-11
Article dans une revue
hal-01995397v1
|
|||
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
|
|||
|
|
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters2017
Pré-publication, Document de travail
hal-01508495v1
|
||
|
|
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 size of homogeneous and of depth four formulas with low individual degree48th Annual Symposium on the Theory of Computing, Jun 2016, Cambridge, United States. pp.626-632, ⟨10.1145/2897518.2897550⟩
Communication dans un congrès
hal-02447342v1
|
||
|
|
On the Sensitivity Conjecture for Disjunctive Normal Forms36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Dec 2016, Chennai, India. ⟨10.4230/LIPIcs.FSTTCS.2016.15⟩
Communication dans un congrès
hal-02447444v1
|
||
|
|
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual DegreeTheory of Computing, 2018, 14 (1), pp.1 - 46. ⟨10.4086/toc.2018.v014a016⟩
Article dans une revue
hal-02447391v1
|