يعرض 1 - 20 نتائج من 200 نتيجة بحث عن '"Tavenas, Sébastien"', وقت الاستعلام: 0.69s تنقيح النتائج
  1. 1
    Report
    Improved fewnomial upper bounds from Wronskians and dessins d'enfant

    المؤلفون: Hilany, Boulos El, Tavenas, Sébastien

    مصطلحات موضوعية: Mathematics - Algebraic Geometry, Mathematics - Combinatorics, Mathematics - Functional Analysis, 14P25, 30D30, 14Q99

    URL الوصول: http://arxiv.org/abs/2409.01651

    View record in Arxiv

    أضف إلى المفضلة
  2. 2
    Report
    On the complexity of Client-Waiter and Waiter-Client games

    المؤلفون: Gledel, Valentin, Oijid, Nacim, Tavenas, Sébastien, Thomassé, Stéphan

    مصطلحات موضوعية: Mathematics - Combinatorics

    URL الوصول: http://arxiv.org/abs/2407.06777

    View record in Arxiv

    أضف إلى المفضلة
  3. 3
    Report
    Rational and lacunary algebraic curves

    المؤلفون: Comte, Georges, Tavenas, Sébastien

    مصطلحات موضوعية: Mathematics - Algebraic Geometry, Mathematics - Complex Variables, 14H50, 14Q05

    URL الوصول: http://arxiv.org/abs/2401.05512

    View record in Arxiv

    أضف إلى المفضلة
  4. 4
    Report
    Towards Optimal Depth-Reductions for Algebraic Formulas

    المؤلفون: Fournier, Hervé, Limaye, Nutan, Malod, Guillaume, Srinivasan, Srikanth, Tavenas, Sébastien

    مصطلحات موضوعية: Computer Science - Computational Complexity

    URL الوصول: http://arxiv.org/abs/2302.06984

    View record in Arxiv

    أضف إلى المفضلة
  5. 5
    Report
    New bounds for the number of connected components of fewnomial hypersurfaces

    المؤلفون: Bihan, Frédéric, Humbert, Tristan, Tavenas, Sébastien

    مصطلحات موضوعية: Mathematics - Algebraic Geometry

    URL الوصول: http://arxiv.org/abs/2208.04590

    View record in Arxiv

    أضف إلى المفضلة
  6. 6
    Conference
    On the Power of Homogeneous Algebraic Formulas

    المؤلفون: Fournier, Hervé, Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sébastien

    المساهمون: Université Paris Cité (UPCité), IT University of Copenhagen (ITU), University of Copenhagen = Københavns Universitet (UCPH), Laboratoire de Mathématiques (LAMA), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry ), Independent Research Fund Denmark (grant agreement No. 10.46540/3103-00116B), Basic Algorithms Research Copenhagen(BARC), supported by VILLUM Foundation Grant 16582, Guest researchers faculty program at Université Paris Cité, ANR-22-CE48-0007,VONBICA,Vers l'obtention de nouvelles bornes inférieures en complexité algébrique(2022)

    المصدر: 56th Annual ACM Symposium on Theory of Computing (STOC ’24)
    https://hal.science/hal-04683830
    56th Annual ACM Symposium on Theory of Computing (STOC ’24), Jun 2024, Vancouver, Canada. ⟨10.1145/3618260.3649760⟩

    مصطلحات موضوعية: Theory of computation → Algebraic complexity theory, Circuit complexity Algebraic Formulas, Formula Homogenization ACM Reference, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    جغرافية الموضوع: Vancouver

    Time: Vancouver, Canada

    الاتاحة: https://hal.science/hal-04683830
    https://hal.science/hal-04683830v1/document
    https://hal.science/hal-04683830v1/file/3618260.3649760.pdf
    https://doi.org/10.1145/3618260.3649760

    View record in BASE

    أضف إلى المفضلة
  7. 7
    Report
    On the Markov numbers: fixed numerator, denominator, and sum conjectures

    المؤلفون: Lagisquet, Clément, Pelantová, Edita, Tavenas, Sébastien, Vuillon, Laurent

    مصطلحات موضوعية: Mathematics - Combinatorics, Mathematics - Number Theory

    URL الوصول: http://arxiv.org/abs/2010.10335

    View record in Arxiv

    أضف إلى المفضلة
  8. 8
    Report
    On the complexity of Client-Waiter and Waiter-Client games ; Complexité des jeux Client-Waiter et Waiter-Client

    المؤلفون: Gledel, Valentin, Oijid, Nacim, Tavenas, Sébastien, Thomassé, Stéphan

    المساهمون: Laboratoire de Mathématiques (LAMA), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )-Centre National de la Recherche Scientifique (CNRS), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry ), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon, Graphes, AlgOrithmes et AppLications (GOAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon), ANR-21-CE48-0001,P-GASE,Jeux positionnels : complexité, algorithmes et stratégies(2021)

    المصدر: https://hal.science/hal-04643212 ; 2024.

    مصطلحات موضوعية: Complexity, PSPACE-Complete, FPT, Positional games, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.06777; hal-04643212; https://hal.science/hal-04643212; https://hal.science/hal-04643212/document; https://hal.science/hal-04643212/file/On%20the%20complexity%20of%20Waiter-Client%20and%20Client-Waiter%20games.pdf; ARXIV: 2407.06777

    الاتاحة: https://hal.science/hal-04643212
    https://hal.science/hal-04643212/document
    https://hal.science/hal-04643212/file/On%20the%20complexity%20of%20Waiter-Client%20and%20Client-Waiter%20games.pdf

    View record in BASE

    أضف إلى المفضلة
  9. 9
    Dissertation/ Thesis
    Bornes inférieures et supérieures dans les circuits arithmétiques
    Upper and lower bounds for arithmetic circuits

    المؤلفون: Tavenas, Sébastien

    Thesis Advisors: Lyon, École normale supérieure, Koiran, Pascal

    مصطلحات موضوعية: Complexité arithmétique, Circuits arithmétiques, Tau-conjecture, Géométrie algébrique réelle, Arithmetic complexity, Arithmetic circuits, Real algebraic geometry

    الاتاحة: http://www.theses.fr/2014ENSL0921/document

    View record in Networked Digital Library of Theses & Dissertations

    أضف إلى المفضلة
  10. 10
    Periodical
    Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.

    المؤلفون: Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sébastien

    المصدر: Communications of the ACM; Feb2024, Vol. 67 Issue 2, p101-108, 8p

    مصطلحات موضوعية: ALGEBRA, POLYNOMIALS, CIRCUIT complexity, ALGORITHMS, DIRECTED acyclic graphs, LOGIC circuits


    أضف إلى المفضلة
  11. 11
    Report
    On the Sensitivity Conjecture for Disjunctive Normal Forms

    المؤلفون: S., Karthik C., Tavenas, Sébastien

    مصطلحات موضوعية: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics

    URL الوصول: http://arxiv.org/abs/1607.05189

    View record in Arxiv

    أضف إلى المفضلة
  12. 12
    Conference
    Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits

    المؤلفون: Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sébastien

    المساهمون: Indian Institute of Technology Bombay (IIT Bombay), Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )

    المصدر: Electronic Colloquium on Computational Complexity, ; FOCS 2021 ; https://hal.science/hal-03367796 ; FOCS 2021, Feb 2022, Denver, United States

    مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    جغرافية الموضوع: Denver, United States

    Relation: hal-03367796; https://hal.science/hal-03367796; https://hal.science/hal-03367796/document; https://hal.science/hal-03367796/file/Revision1OfTR21-081.pdf

    الاتاحة: https://hal.science/hal-03367796
    https://hal.science/hal-03367796/document
    https://hal.science/hal-03367796/file/Revision1OfTR21-081.pdf

    View record in BASE

    أضف إلى المفضلة
  13. 13
    Conference
    Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication

    المؤلفون: Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sébastien

    المساهمون: IT University of Copenhagen (ITU), Aarhus University Aarhus, Université Savoie Mont Blanc (USMB Université de Savoie Université de Chambéry )

    المصدر: https://hal.science/hal-03761732 ; Jun 2022, Rome, Italy. pp.416-425, ⟨10.1145/3519935.3520044⟩.

    مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

    جغرافية الموضوع: Rome, Italy

    Relation: hal-03761732; https://hal.science/hal-03761732; https://hal.science/hal-03761732/document; https://hal.science/hal-03761732/file/paperSMNFLBIMM.pdf

    الاتاحة: https://hal.science/hal-03761732
    https://hal.science/hal-03761732/document
    https://hal.science/hal-03761732/file/paperSMNFLBIMM.pdf
    https://doi.org/10.1145/3519935.3520044

    View record in BASE

    أضف إلى المفضلة
  14. 14
    Academic Journal
    On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials

    المؤلفون: Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sébastien

    المساهمون: Nutan Limaye and Srikanth Srinivasan and Sébastien Tavenas

    مصطلحات موضوعية: Partial Derivative Method, Barriers to Lower Bounds

    وصف الملف: application/pdf

    Relation: Is Part Of LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.32

    الاتاحة: https://doi.org/10.4230/LIPIcs.CCC.2022.32
    https://nbn-resolving.org/urn:nbn:de:0030-drops-165942
    https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.32

    View record in BASE

    أضف إلى المفضلة
  15. 15
    Report
    Log-concavity and lower bounds for arithmetic circuits

    المؤلفون: García-Marco, Ignacio, Koiran, Pascal, Tavenas, Sébastien

    المصدر: MFCS 2015, Part II, LNCS 9235, pp. 361-371 (2015)

    مصطلحات موضوعية: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Mathematics - Commutative Algebra

    URL الوصول: http://arxiv.org/abs/1503.07705

    View record in Arxiv

    أضف إلى المفضلة
  16. 16
    Report
    Building Efficient and Compact Data Structures for Simplicial Complexes

    المؤلفون: Boissonnat, Jean-Daniel, S., Karthik C., Tavenas, Sébastien

    مصطلحات موضوعية: Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms

    URL الوصول: http://arxiv.org/abs/1503.07444

    View record in Arxiv

    أضف إلى المفضلة
  17. 17
    Report
    On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem

    المؤلفون: Koiran, Pascal, Portier, Natacha, Tavenas, Sébastien

    مصطلحات موضوعية: Computer Science - Computational Complexity, Mathematics - Algebraic Geometry

    URL الوصول: http://arxiv.org/abs/1310.2447

    View record in Arxiv

    أضف إلى المفضلة
  18. 18
    Report
    The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters

    المؤلفون: Lagoutte, Aurélie, Tavenas, Sébastien

    مصطلحات موضوعية: Computer Science - Discrete Mathematics, Mathematics - Combinatorics

    URL الوصول: http://arxiv.org/abs/1309.0422

    View record in Arxiv

    أضف إلى المفضلة
  19. 19
    Report
    Detecting wheels

    المؤلفون: Diot, Emilie, Tavenas, Sébastien, Trotignon, Nicolas

    المصدر: Applicable Analysis and Discrete Mathematics, 8:111-122, 2014

    مصطلحات موضوعية: Computer Science - Discrete Mathematics, Mathematics - Combinatorics, 05C75

    URL الوصول: http://arxiv.org/abs/1308.6433

    View record in Arxiv

    أضف إلى المفضلة
  20. 20
    Report
    A tau-conjecture for Newton polygons

    المؤلفون: Koiran, Pascal, Portier, Natacha, Tavenas, Sébastien, Thomassé, Stéphan

    مصطلحات موضوعية: Computer Science - Computational Complexity

    URL الوصول: http://arxiv.org/abs/1308.2286

    View record in Arxiv

    أضف إلى المفضلة
أدوات البحث: أحصل على تغذية RSS – أرسل هذا البحث بالبريد الإلكتروني – حفظ البحث – جدول التنبيهات: لا شيء