A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jcss/Oppen78, #quickstatements; #temporary_batch_1731483406851 |
||
| 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
