Integer linear-exponential programming in NP by quantifier elimination
From MaRDI portal
Cites work
- 50 Years of Integer Programming 1958-2008
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- A decision procedure for string constraints with string/integer conversion and flat regular constraints
- A strong version of Cobham’s theorem
- A uniform method for proving lower bounds on the computational complexity of logical theories
- Approaching arithmetic theories with finite-state automata
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Complexity hierarchies beyond elementary
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- scientific article; zbMATH DE number 4031630 (Why is no real title available?)
- scientific article; zbMATH DE number 3478862 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1253963 (Why is no real title available?)
- scientific article; zbMATH DE number 1169378 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Logic and p-recognizable sets of integers
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- Monadic decomposition in integer linear arithmetic
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
- On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
- On the complexity of integer programming
- On the existential theories of Büchi arithmetic and linear p-adic fields
- On the expressiveness of Büchi arithmetic
- Satisfiability modulo exponential integer arithmetic
- Semënov arithmetic, affine \{VASS\}, and string constraints
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- The complexity of almost linear diophantine problems
- The complexity of Presburger arithmetic with power or powers
- The Logical Approach to Automatic Sequences
- The past, evolving present, and future of the discrete logarithm
- Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
- Variable independence for first-order definable constraints
- Weak Integer Quantifier Elimination Beyond the Linear Case
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(2)
This page was built for publication: Integer linear-exponential programming in NP by quantifier elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875049)
