Easy lower bound for a strange computational model

DOI10.1007/BF01294255MaRDI QIDQ1377572zbMATH OpenFDO

Authors Roman Smolensky

Publication date 9 June 1998

Published in Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

algebraic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Lower bounds for the complexity of polynomials
• scientific article; zbMATH DE number 139642
• Models of lower-bounds proofs
• Algebraic complexity theory. I: An introduction

Cites work

• scientific article; zbMATH DE number 1142301 (Why is no real title available?)
• The complexity of partial derivatives

Cited in

(4)

• A quadratic lower bound for algebraic branching programs
• scientific article; zbMATH DE number 4172392 (Why is no real title available?)
• Quadratic lower bounds for algebraic branching programs and formulas
• A quadratic lower bound for homogeneous algebraic branching programs

This page was built for publication: Easy lower bound for a strange computational model

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