Daniel Silva Graça
Orcid: 0000-0002-0330-833XAffiliations:
- University of Algarve, Faro, Portugal
According to our database1,
Daniel Silva Graça
authored at least 40 papers
between 2003 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on w3.ualg.pt
-
on andrej.com
On csauthors.net:
Bibliography
2023
A continuous characterization of PSPACE using polynomial ordinary differential equations.
J. Complex., August, 2023
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines.
Comput., 2023
Characterizing time computational complexity classes with polynomial differential equations.
Comput., 2023
2021
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable.
Theor. Comput. Sci., 2021
Proceedings of the Connecting with Computability, 2021
2018
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.
J. ACM, 2017
Inf. Comput., 2017
2016
Computational complexity of solving polynomial differential equations over unbounded domains.
Theor. Comput. Sci., 2016
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version).
CoRR, 2016
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.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable.
Theory Comput. Syst., 2015
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015
2014
Computational complexity of solving elementary differential equations over unbounded domains.
CoRR, 2014
2013
Proceedings of the Theory and Applications of Models of Computation, 2013
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited.
Theor. Comput. Sci., 2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
2009
Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach.
J. Univers. Comput. Sci., 2009
Proceedings of the Unconventional Computation, 8th International Conference, 2009
2008
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008
2007
Polynomial differential equations compute all real computable functions on computable compact intervals.
J. Complex., 2007
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007
2006
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.
Proceedings of the Theory and Applications of Models of Computation, 2006
2005
Proceedings of the New Computational Paradigms, 2005
2004
Math. Log. Q., 2004
2003