Pages that link to "Item:Q1163534"

The following pages link to The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534):

Displaying 18 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)
• The complexity of linear problems in fields (Q1103602) (← 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)
• Complexity of Presburger arithmetic with fixed quantifier dimension (Q1361890) (← links)
• The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
• Automatic verification of recursive procedures with one integer parameter. (Q1401233) (← links)
• A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
• A complete and terminating approach to linear integer solving (Q2307624) (← links)
• Complexity of Subcases of Presburger Arithmetic (Q3340842) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• Limit, logic, and computation (Q4378032) (← links)
• Short Presburger Arithmetic Is Hard (Q5073520) (← links)
• Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)