Worst-case complexity bounds for algorithms in the theory of integral quadratic forms (Q3928238): 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/0196-6774(80)90021-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025525128 / rank | |||
Normal rank | |||
Latest revision as of 00:22, 20 March 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
