Complexity of Bezout's theorem. V: Polynomial time (Q1338222): 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/0304-3975(94)90122-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063917062 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Bezout's theorem. V: Polynomial time |
scientific article |
Statements
Complexity of Bezout's theorem. V: Polynomial time (English)
0 references
26 September 1996
0 references
complexity
0 references
Bezout's theorem
0 references
algorithms
0 references
approximate zero
0 references
system of polynomial equations
0 references
polynomial time
0 references
number of arithmetic operations
0 references
