scientific article; zbMATH DE number 3795355

MaRDI QIDQ4741700zbMATH OpenFDO

Authors Dima Grigoriev

Publication date 1982

Full work available at URL https://eudml.org/doc/67384

zbMATH Keywords

algebraic complexitystraight line programssurvey

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(6)

• Test complexity of generic polynomials
• Improved lower bounds on the rigidity of Hadamard matrices
• Arithmetic complexity of certain linear transformations
• The arithmetic computational complexity of linear transforms
• Some aspects of complexity in real algebraic geometry
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4741700)