No. Title Author Year
1 On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract) Haase, Christoph et al. 2023
2 Algebraic Invariants for Linear Hybrid Automata Majumdar, Rupak et al. 2020
3 Reachability in Dynamical Systems with Rounding Baier, Christel et al. 2020
4 A Universal Ordinary Differential Equation Bournez, Olivier et al. 2017
5 Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem Fijalkow, Nathanaƫl et al. 2017
6 Model Checking Flat Freeze LTL on One-Counter Automata Lechner, Antonia et al. 2016
7 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 Bournez, Olivier et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI