scientific article; zbMATH DE number 3795355

zbMath0504.68024MaRDI QIDQ4741700

Dima Yu. Grigoriev

Publication date: 1982

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyalgebraic complexitystraight line programs

Mathematics Subject Classification ID

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

Related Items (6)

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

This page was built for publication: