scientific article; zbMATH DE number 3974292

zbMATH Open0603.68043MaRDI QIDQ3740233FDOQ3740233

Authors: R. G. Nigmatullin 

Publication date: 1985

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

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3960990
• scientific article; zbMATH DE number 4070302
• On parallel evaluation of certain classes of polynomials with an increasing number of variables
• Algebraic complexity of computing polynomial zeros
• Lower bounds for the complexity of polynomials

zbMATH Keywords

complexity of polynomial evaluation by combinational circuitsstraight- line programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (2)

• On zeros of exponential polynomials and quantum algorithms
• Title not available (Why is that?)

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 Q3740233)