Easy lower bound for a strange computational model

DOI10.1007/BF01294255zbMath0890.68056MaRDI QIDQ1377572

Roman Smolensky

Publication date: 9 June 1998

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

zbMATH Keywords

algebraic complexity

Mathematics Subject Classification ID

Related Items (3)

Quadratic lower bounds for algebraic branching programs and formulas ⋮ A quadratic lower bound for algebraic branching programs ⋮ A quadratic lower bound for homogeneous algebraic branching programs

Cites Work

• The complexity of partial derivatives
• Unnamed Item

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