Pages that link to "Item:Q1115858"

The following pages link to Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858):

Displaying 11 items.

• Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
• Dominoes and the complexity of subclasses of logical theories (Q1115859) (← 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)
• 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)
• State-based opacity of labeled real-time automata (Q6122597) (← links)
• On Presburger arithmetic extended with non-unary counting quantifiers (Q6135772) (← links)