On the public citation graph

Complexity of presburger arithmetic with fixed quantifier dimension

https://doi.org/10.1007/bf02679468
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/1-4020-0611-x_141openalex-snapshot
COMPUTATIONAL Complexity
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_5openalex-snapshot
Super-Exponential Complexity of Presburger Arithmetic
inferredcites →https://doi.org/10.1007/bfb0062837openalex-snapshot
The Computational Complexity of Logical Theories
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(80)90037-7openalex-snapshot
The complexity of logical theories
inferredcites →https://doi.org/10.1016/0304-3975(82)90115-3openalex-snapshot
The complexity of presburger arithmetic with bounded quantifier alternation depth
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0742421-9openalex-snapshot
Complexity of Subcases of Presburger Arithmetic
inferredcites →https://doi.org/10.1145/800133.804361openalex-snapshot
Presburger arithmetic with bounded quantifier alternation
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-48168-0_6openalex-snapshot
Descriptive Complexity Theory for Constraint Databases
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_7openalex-snapshot
Declarative Data Analysis Using Limit Datalog Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_37openalex-snapshot
Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_13openalex-snapshot
Unary Pushdown Automata and Straight-Line Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_24openalex-snapshot
On Presburger Arithmetic Extended with Modulo Counting Quantifiers
inferred← citeshttps://doi.org/10.1007/bfb0055775openalex-snapshot
On the word, subsumption, and complement problem for recurrent term schematizations
inferred← citeshttps://doi.org/10.1017/fms.2017.29openalex-snapshot
COMPLEXITY OF SHORT GENERATING FUNCTIONS
inferred← citeshttps://doi.org/10.1017/jsl.2015.4openalex-snapshot
PRESBURGER ARITHMETIC, RATIONAL GENERATING FUNCTIONS, AND QUASI-POLYNOMIALS
inferred← citeshttps://doi.org/10.1109/focs.2017.13openalex-snapshot
Short Presburger Arithmetic Is Hard
inferred← citeshttps://doi.org/10.1109/lics.2004.1319605openalex-snapshot
On the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1137/17m1118907openalex-snapshot
Enumerating Projections of Integer Points in Unbounded Polyhedra
inferred← citeshttps://doi.org/10.1137/17m1151146openalex-snapshot
Short Presburger Arithmetic Is Hard
inferred← citeshttps://doi.org/10.1145/1342991.1342995openalex-snapshot
Bounds on the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/2603088.2603092openalex-snapshot
Subclasses of presburger arithmetic and the weak EXP hierarchy
inferred← citeshttps://doi.org/10.1145/3055399.3055435openalex-snapshot
Complexity of short Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/3242953.3242964openalex-snapshot
A survival guide to presburger arithmetic
inferred← citeshttps://doi.org/10.1145/3495009openalex-snapshot
The Complexity and Expressive Power of Limit Datalog
inferred← citeshttps://doi.org/10.1145/378795.378859openalex-snapshot
Exact analysis of the cache behavior of nested loops
inferred← citeshttps://doi.org/10.1145/381694.378859openalex-snapshot
Exact analysis of the cache behavior of nested loops
inferred← citeshttps://doi.org/10.1287/moor.2018.0988openalex-snapshot
The Computational Complexity of Integer Programming with Alternations
inferred← citeshttps://doi.org/10.4171/022-3/39openalex-snapshot
The complexity of generating functions for integer points in polyhedra and beyond
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:4)2023openalex-snapshot
On Presburger arithmetic extended with non-unary counting quantifiers
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.