The complexity of almost linear diophantine problems (Q753494)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4180804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of almost linear diophantine problems |
scientific article; zbMATH DE number 4180804 |
Statements
The complexity of almost linear diophantine problems (English)
0 references
1990
0 references
Presburger arithmetic
0 references
complexity bounds
0 references
0.92935187
0 references
0.9273603
0 references
0.91956437
0 references
0 references
0.9145111
0 references
0.9032956
0 references
