Pages that link to "Item:Q3340842"

The following pages link to Complexity of Subcases of Presburger Arithmetic (Q3340842):

Displaying 24 items.

• The complexity of almost linear diophantine problems (Q753494) (← links)
• Simple sentences that are hard to decide (Q810009) (← links)
• A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
• Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
• Lower bound results on lengths of second-order formulas (Q1071760) (← links)
• Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
• Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
• Sentences over integral domains and their computational complexities (Q1286369) (← links)
• A formal derivation of the decidability of the theory SA (Q1325831) (← links)
• Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
• On the virtue of categoricity (Q1981999) (← links)
• Short Presburger Arithmetic Is Hard (Q5073520) (← links)
• (Q5111264) (← links)
• (Q5136335) (← links)
• (Q5155665) (← links)
• (Q5155690) (← links)
• Target counting with Presburger constraints and its application in sensor networks (Q5160798) (← links)
• A Pattern Logic for Automata with Outputs (Q5859645) (← links)
• Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)
• Decidable weighted expressions with Presburger combinators (Q5915759) (← links)
• Parity games on temporal graphs (Q6629452) (← links)
• Reasoning on data words over numeric domains (Q6649469) (← links)
• Positive existential Definability with unit, addition and coprimeness (Q6666557) (← links)