( en | de | ru )

 

Disambiguation of "Pouly, Amaury"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version).

, , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amaury Pourteau

Amaury Pourteau

Amaury Pourteau

Paul-Amaury Matt

Amaury Ernesto Fernández-Montalván

 

Other publications of authors with the same name

Continuous models of computation: from computability to complexity. (Modèles de calculs à temps continu: de la calculabilité à la complexité).. Universidad do Algarve, Faro, Portugal, (2015)Provable Dual Attacks on Learning with Errors., and . IACR Cryptol. ePrint Arch., (2023)Explicit Error Bounds for Carleman Linearization., and . CoRR, (2017)On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices., , , , and . ISSAC, page 129-138. ACM, (2022)Algebraic Invariants for Linear Hybrid Automata., , , and . CONCUR, volume 171 of LIPIcs, page 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Functions Generated by the General Purpose Analog Computer., , and . CoRR, (2016)Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length., , and . CoRR, (2016)Turing machines can be efficiently simulated by the General Purpose Analog Computer., , and . CoRR, (2012)Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs., , , and . CMSB, volume 10545 of Lecture Notes in Computer Science, page 108-127. Springer, (2017)On the decidability of reachability in continuous time linear time-invariant systems., and . HSCC, page 15:1-15:12. ACM, (2021)