Computational complexity of computing polynomials over the fields of real and complex numbers (Q5402553): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/800133.804344 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108615867 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:27, 19 March 2024
scientific article; zbMATH DE number 6270114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of computing polynomials over the fields of real and complex numbers |
scientific article; zbMATH DE number 6270114 |
Statements
Computational complexity of computing polynomials over the fields of real and complex numbers (English)
0 references
14 March 2014
0 references
complexity of computation
0 references
evaluation
0 references
lower bounds of complexity
0 references
number of arithmetic operations
0 references
optimal schemes of computation
0 references
polynomial
0 references
preconditioning
0 references
scheme of computation
0 references
upper bounds of complexity
0 references
