No. Title Author Year
1 On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract) Haase, Christoph et al. 2023
2 Universal Quantification Makes Automatic Structures Hard to Decide Haase, Christoph et al. 2023
3 Higher-Order Quantified Boolean Satisfiability Chistikov, Dmitry et al. 2022
4 On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes Haase, Christoph et al. 2021
5 On the Power of Ordering in Linear Arithmetic Theories Chistikov, Dmitry et al. 2020
6 On the Size of Finite Rational Matrix Semigroups Bumpus, Georgina et al. 2020
7 Affine Extensions of Integer Vector Addition Systems with States Blondin, Michael et al. 2018
8 Counting Problems for Parikh Images Haase, Christoph et al. 2017
9 On the Complexity of Quantified Integer Programming Chistikov, Dmitry et al. 2017
10 A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One Göller, Stefan et al. 2016
11 The Taming of the Semi-Linear Set Chistikov, Dmitry et al. 2016
12 Tightening the Complexity of Equivalence Problems for Commutative Grammars Haase, Christoph et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 12

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