A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(78)90021-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008770192 / rank | |||
Normal rank | |||
Revision as of 21:36, 19 March 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
