On parallel evaluation of certain classes of polynomials with an increasing number of variables

zbMATH Open0727.68036MaRDI QIDQ804282FDOQ804282

Authors: S. B. Gashkov 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 4070302
• On the parallel evaluation of multivariate polynomials
• The parallel complexity of function approximation
• scientific article; zbMATH DE number 3890599
• On fast multiplication of polynomials over arbitrary algebras

zbMATH Keywords

complexity of formulasdepth of formulasparallel evaluation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (14)

• Title not available (Why is that?)
• Computing polynomials with few multiplications
• Title not available (Why is that?)
• Polynomials with Rational Coefficients Which are Hard to Compute
• Representation of monomials as a sum of powers of linear forms
• On the parallel evaluation of multivariate polynomials
• The number of certain integral polynomials and nonrecursive sets of integers, Part 1
• The actual complexity of parallel evaluation of low degree polynomials
• The complexity of pseudo-linear functions
• Complexity of functions from some classes of three-valued logic
• Massively parallel computations on many-variable polynomials
• Title not available (Why is that?)
• A unified method for placing problems in polylogarithmic depth
• On the multiplicative complexity of polynomials

This page was built for publication: On parallel evaluation of certain classes of polynomials with an increasing number of variables

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