Easy lower bound for a strange computational model

DOI10.1007/BF01294255zbMATH Open0890.68056MaRDI QIDQ1377572FDOQ1377572

Authors: Roman Smolensky 

Publication date: 9 June 1998

Published in: Computational Complexity (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

algebraic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• The complexity of partial derivatives
• Title not available (Why is that?)

Cited In (4)

• A quadratic lower bound for algebraic branching programs
• Title not available (Why is that?)
• 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)