Lower Bounds for Linear Decision Trees via an Energy Complexity Argument

DOI10.1007/978-3-642-22993-0_51zbMath1343.68102OpenAlexW131785927MaRDI QIDQ3088072

Kei Uchizawa, Eiji Takimoto

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_51

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Energy Complexity of Recurrent Neural Networks

This page was built for publication: Lower Bounds for Linear Decision Trees via an Energy Complexity Argument