A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5674430 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4401928 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4082296 / rank | |||
Normal rank | |||
Revision as of 22:41, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic |
scientific article |
Statements
A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (English)
0 references
1978
0 references
