A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/jcss/Oppen78, #quickstatements; #temporary_batch_1731483406851 |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jcss/Oppen78 / rank | |||
Normal rank | |||
Latest revision as of 08:50, 13 November 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
