A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56059275, #quickstatements; #temporary_batch_1704701117765 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56059275 / rank | |||
Normal rank | |||
Revision as of 09:07, 8 January 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
