Lower Bounds for Linear Decision Trees via an Energy Complexity Argument-Reference-Cited by-同舟云学术

Lower Bounds for Linear Decision Trees via an Energy Complexity Argument

Published:2011 Issue: Volume: Page:568-579
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2011
language:
Short-container-title:

Author:

Uchizawa Kei,Takimoto Eiji

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22993-0_51.pdf

Reference19 articles.

1. Lecture Notes in Computer Science;K. Amano,2005

2. Björner, A., Lovász, L., Yao, A.C.C.: Linear decision trees: volume estimates and topological bounds. In: Procedings of the 24th ACM Symposyum on Theory of Computing, pp. 170–177 (1992)

3. Dobkin, D.P., Lipton, R.J.: On the complexity of computations under varying sets of primitives. Journal of Computer and System Sciences 3, 1–8 (1982)

4. Erickson, J.: Lower bounds for linear satisfiability problems. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 388–395 (1995)

5. Fleischer, R.: Decision trees: Old and new results. Information and Computation 152, 44–61 (1999)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Energy-Time Tradeoff in Recurrent Neural Nets;Springer Series in Bio-/Neuroinformatics;2015

2. Lower Bounds for Linear Decision Trees with Bounded Weights;Lecture Notes in Computer Science;2015

3. Energy Complexity of Recurrent Neural Networks;Neural Computation;2014-05

4. A Low-Energy Implementation of Finite Automata by Optimal-Size Neural Nets;Artificial Neural Networks and Machine Learning – ICANN 2013;2013