Complexity of Subcases of Presburger Arithmetic
From MaRDI portal
Recommendations
Cites work
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- scientific article; zbMATH DE number 3478862 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3532959 (Why is no real title available?)
- scientific article; zbMATH DE number 3534486 (Why is no real title available?)
- scientific article; zbMATH DE number 3595168 (Why is no real title available?)
- scientific article; zbMATH DE number 3304006 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- NP-complete decision problems for binary quadratics
- Presburger arithmetic with bounded quantifier alternation
- The complexity of Presburger arithmetic with bounded quantifier alternation depth
- The computational complexity of logical theories
Cited in
(42)- Lower bound results on lengths of second-order formulas
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy
- Dominoes and the complexity of subclasses of logical theories
- Sentences over integral domains and their computational complexities
- A formal derivation of the decidability of the theory SA
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- On the virtue of categoricity
- Double-exponential inseparability of Robinson subsystem \(Q_{+}\)
- Generic Complexity of Presburger Arithmetic
- On the use of non-deterministic automata for Presburger arithmetic
- Computational complexities of diophantine equations with parameters
- scientific article; zbMATH DE number 1253963 (Why is no real title available?)
- scientific article; zbMATH DE number 1342223 (Why is no real title available?)
- Subclasses of Presburger arithmetic and the weak EXP hierarchy
- On the complexity of linear arithmetic with divisibility
- scientific article; zbMATH DE number 1929303 (Why is no real title available?)
- Complexity of short Presburger arithmetic
- Short Presburger Arithmetic Is Hard
- Parametric Presburger arithmetic: complexity of counting and quantifier elimination
- scientific article; zbMATH DE number 7204383 (Why is no real title available?)
- Querying best paths in graph databases
- Presburger arithmetic with algebraic scalar multiplications
- Modular path queries with arithmetic
- Target counting with Presburger constraints and its application in sensor networks
- Foundations of Software Science and Computational Structures
- A pattern logic for automata with outputs
- Decidable models of integer-manipulating programs with recursive parallelism
- Parity games on temporal graphs
- Reasoning on data words over numeric domains
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- Positive existential Definability with unit, addition and coprimeness
- On polynomial-time decidability of k-negations fragments of first-order theories
- Strategic dominance: a new preorder for nondeterministic processes
- A first taste of MeSCaL, a tool for solving membership problems for regular languages
- An introduction to the theory of linear integer arithmetic (invited paper)
- Temporal explorability games
- The complexity of almost linear diophantine problems
- Simple sentences that are hard to decide
- Generic complexity of Presburger arithmetic
- A uniform method for proving lower bounds on the computational complexity of logical theories
- Proof synthesis and reflection for linear arithmetic
This page was built for publication: Complexity of Subcases of Presburger Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340842)
