The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:23, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the equivalence problem for two characterizations of Presburger sets |
scientific article |
Statements
The complexity of the equivalence problem for two characterizations of Presburger sets (English)
0 references
1981
0 references
Presburger formulas
0 references
reversal-bounded multicounter machines
0 references
upper bound
0 references
deterministic time complexity
0 references
inequivalence problem
0 references
semilinear sets
0 references
Presburger relations
0 references
