Pages that link to "Item:Q1247317"

The following pages link to A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317):

Displaying 45 items.

• Decision procedures for flat array properties (Q287272) (← links)
• An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
• Model-theoretic methods in combined constraint satisfiability (Q556677) (← links)
• Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
• XML schema, tree logic and sheaves automata (Q862561) (← links)
• Schemas for unordered XML on a DIME (Q905687) (← links)
• A full first-order constraint solver for decomposable theories (Q1044229) (← links)
• From decomposable to residual theories (Q1045812) (← links)
• Complexity, convexity and combinations of theories (Q1141138) (← links)
• The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
• Persistence of vector replacement systems is decidable (Q1149775) (← links)
• Complexity results for classes of quantificational formulas (Q1157324) (← links)
• The complexity of logical theories (Q1159661) (← links)
• Complexity of logical theories involving coprimality (Q1202924) (← links)
• Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
• Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
• On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
• Emptiness problems for integer circuits (Q2182324) (← links)
• A practical approach to model checking duration calculus using Presburger arithmetic (Q2251131) (← links)
• A complete and terminating approach to linear integer solving (Q2307624) (← links)
• Łukasiewicz logics for cooperative games (Q2321328) (← links)
• Bounded model checking of infinite state systems (Q2369883) (← links)
• Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
• The Value-Passing Calculus (Q2842635) (← links)
• Temporal Specifications with Accumulative Values (Q2946736) (← links)
• Double-exponential inseparability of Robinson subsystem <i>Q</i>₊ (Q3083130) (← links)
• Parallélisation sémantique (Q3479539) (← links)
• Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (Q3618581) (← links)
• Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
• Tarski’s Influence on Computer Science (Q4611682) (← links)
• Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols (Q4921500) (← links)
• (Q5009704) (← links)
• Short Presburger Arithmetic Is Hard (Q5073520) (← links)
• (Q5079723) (← links)
• Uniformly Automatic Classes of Finite Structures (Q5090943) (← links)
• Parametric Presburger arithmetic: complexity of counting and quantifier elimination (Q5108860) (← links)
• (Q5155665) (← links)
• Target counting with Presburger constraints and its application in sensor networks (Q5160798) (← links)
• An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints (Q5191405) (← links)
• Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)
• (Q5389748) (← links)
• Hairpin completions and reductions: semilinearity properties (Q6095486) (← links)
• On Presburger arithmetic extended with non-unary counting quantifiers (Q6135772) (← links)
• Simulation by Rounds of Letter-to-Letter Transducers (Q6178697) (← links)
• INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)