Lower Bounds for Linear Decision Trees with Bounded Weights

DOI10.1007/978-3-662-46078-8_34zbMath1432.68167OpenAlexW2237485987MaRDI QIDQ5175129

Kei Uchizawa, Eiji Takimoto

Publication date: 20 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_34

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

On (simple) decision tree rank ⋮ Linear threshold functions in decision lists, decision trees, and depth-2 circuits

This page was built for publication: Lower Bounds for Linear Decision Trees with Bounded Weights