Lower bounds for the complexity of polynomials (Q1822977): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On polynomials with symmetric Galois group which are easy to compute / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Evaluation of polynomials with super-preconditioning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for the Computation of Linear Forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the additive complexity of polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the representation of rational functions of bounded complexity / rank | |||
Normal rank |
Latest revision as of 10:33, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for the complexity of polynomials |
scientific article |
Statements
Lower bounds for the complexity of polynomials (English)
0 references
1989
0 references
lower bounds
0 references
polynomials with 0-1-coefficients
0 references