Worst-case complexity bounds for algorithms in the theory of integral quadratic forms (Q3928238): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:58, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case complexity bounds for algorithms in the theory of integral quadratic forms |
scientific article |
Statements
Worst-case complexity bounds for algorithms in the theory of integral quadratic forms (English)
0 references
1980
0 references
binary quadratic Diophantine equations
0 references
polynomial worst-case running time bounds
0 references
