Super-Exponential Complexity of Presburger Arithmetic¶
Fischer, M. J., & Rabin, M. O. (1974). Super-Exponential Complexity of Presburger Arithmetic. Complexity of Computation.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Language-Fragment Restriction
- Cut the fragment too tight and the very thing users need is missing, so they abandon it for an undecidable escape hatch; and decidability is not feasibility
This sourceProves enormous lower bounds for decidable theories such as Presburger arithmetic, showing that guaranteed decidability can remain computationally infeasible.
- Cut the fragment too tight and the very thing users need is missing, so they abandon it for an undecidable escape hatch; and decidability is not feasibility
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:dda266d2cbb0 · see in the full table