Complexity of Bezout's theorem. V: Polynomial time (Q1338222): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:27, 31 January 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
