Pages that link to "Item:Q1115858"
From MaRDI portal
The following pages link to Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858):
Displaying 17 items.
- Some remarks on subclass containment problems for several classes of dpda's (Q799387) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
- Automatic verification of recursive procedures with one integer parameter. (Q1401233) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
- Subclasses of presburger arithmetic and the weak EXP hierarchy (Q4635632) (← links)
- Complexity of short Presburger arithmetic (Q4978025) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
- Parametric Presburger arithmetic: complexity of counting and quantifier elimination (Q5108860) (← links)
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)
- Turing-Complete Subclasses of CHR (Q5504695) (← links)
- Model checking parameterized asynchronous shared-memory systems (Q5892422) (← links)
- State-based opacity of labeled real-time automata (Q6122597) (← links)
- On Presburger arithmetic extended with non-unary counting quantifiers (Q6135772) (← links)