1
TÍTULO: Rigorous numerical computation of polynomial differential equations over unbounded domains
AUTORES: Bournez, O; Graça, DS; Pouly, A;
PUBLICAÇÃO: 2016, FONTE: 6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 9582
INDEXADO EM: Scopus CrossRef
2
TÍTULO: Computing with polynomial ordinary differential equations  Full Text
AUTORES: Olivier Bournez; Daniel Graca; Amaury Pouly;
PUBLICAÇÃO: 2016, FONTE: JOURNAL OF COMPLEXITY, VOLUME: 36
INDEXADO EM: WOS CrossRef
3
TÍTULO: Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: The general purpose analog computer and computable analysis are two efficiently equivalent models of computations
AUTORES: Bournez, O; Graca, DS; Pouly, A;
PUBLICAÇÃO: 2016, FONTE: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 in Leibniz International Proceedings in Informatics, LIPIcs, VOLUME: 55
INDEXADO EM: Scopus
4
TÍTULO: Computation with perturbed dynamical systems  Full Text
AUTORES: Olivier Bournez; Daniel S Graca ; Emmanuel Hainry;
PUBLICAÇÃO: 2013, FONTE: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, VOLUME: 79, NÚMERO: 5
INDEXADO EM: Scopus WOS CrossRef
5
TÍTULO: Computability and computational complexity of the evolution of nonlinear dynamical systems
AUTORES: Bournez, O; Graca, DS ; Pouly, A; Zhong, N;
PUBLICAÇÃO: 2013, FONTE: 9th Conference on Computability in Europe - The Nature of Computation: Logic, Algorithms, Applications, CiE 2013 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7921 LNCS
INDEXADO EM: Scopus CrossRef
6
TÍTULO: Turing machines can be efficiently simulated by the general purpose analog computer
AUTORES: Bournez, O; Graca, DS; Pouly, A;
PUBLICAÇÃO: 2013, FONTE: 10th International Conference on Theory and Applications of Models of Computation, TAMC 2013 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7876 LNCS
INDEXADO EM: Scopus CrossRef
7
TÍTULO: On the complexity of solving initial value problems
AUTORES: Bournez, O; Graca, DS ; Pouly, A;
PUBLICAÇÃO: 2012, FONTE: 37th International Symposium on Symbolic and Algebraic Computation, ISSAC 2012 in Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
INDEXADO EM: Scopus CrossRef
8
TÍTULO: Solving analytic differential equations in polynomial time over unbounded domains
AUTORES: Bournez, O; Graca, DS ; Pouly, A;
PUBLICAÇÃO: 2011, FONTE: 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6907 LNCS
INDEXADO EM: Scopus CrossRef
9
TÍTULO: Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
AUTORES: Olivier Bournez; Daniel S Graca; Amaury Pouly;
PUBLICAÇÃO: 2011, FONTE: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS) / Young Research Forum in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, VOLUME: 6907
INDEXADO EM: WOS
10
TÍTULO: Robust computations with dynamical systems
AUTORES: Bournez, O; Graca, DS ; Hainry, E;
PUBLICAÇÃO: 2010, FONTE: 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6281 LNCS
INDEXADO EM: Scopus CrossRef
Página 1 de 2. Total de resultados: 13.