A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic |
scientific article; zbMATH DE number 3591967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic |
scientific article; zbMATH DE number 3591967 |
Statements
A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (English)
0 references
1978
0 references
