The complexity of monotone computations of polynomials

zbMath0655.68035MaRDI QIDQ1109563

Sergey B. Gashkov

Publication date: 1987

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

sparse setssemi-ringcomplexity of computationsemi-groupmonotone polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Representation of monomials as a sum of powers of linear forms

This page was built for publication: The complexity of monotone computations of polynomials