( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.

, , , , и . Theory Comput. Syst., 63 (5): 1027-1048 (2019)

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.

Amaury Pourteau

Amaury Pourteau

Amaury Pourteau

Paul-Amaury Matt

Amaury Ernesto Fernández-Montalván

 

Другие публикации лиц с тем же именем

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)Explicit Error Bounds for Carleman Linearization., и . CoRR, (2017)Provable Dual Attacks on Learning with Errors., и . IACR Cryptol. ePrint Arch., (2023)On the Functions Generated by the General Purpose Analog Computer., , и . CoRR, (2016)Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length., , и . CoRR, (2016)On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices., , , , и . ISSAC, стр. 129-138. ACM, (2022)Algebraic Invariants for Linear Hybrid Automata., , , и . CONCUR, том 171 из LIPIcs, стр. 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Turing machines can be efficiently simulated by the General Purpose Analog Computer., , и . CoRR, (2012)Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs., , , и . CMSB, том 10545 из Lecture Notes in Computer Science, стр. 108-127. Springer, (2017)On the decidability of reachability in continuous time linear time-invariant systems., и . HSCC, стр. 15:1-15:12. ACM, (2021)