On the Complexity of Depth-2 Circuits with Threshold Gates-Reference-Cited by-同舟云学术

On the Complexity of Depth-2 Circuits with Threshold Gates

Published:2005 Issue: Volume: Page:107-118
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2005
language:
Short-container-title:

Author:

Amano Kazuyuki,Maruoka Akira

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11549345_11.pdf

Reference22 articles.

1. Alon, N., Bruck, J.: Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. SIAM J. Disc. Math. 7(1), 1–8 (1994)

2. Amano, K., Maruoka, A.: Better Simulation of Exponential Weights by Polynomial Weights, Technical Report ECCC TR04-090 (2004)

3. Basu, S., Bhatnagar, N., Gopalan, P., Lipton, R.J.: Polynomials that Sign Represent Parity and Descartes Rule of Signs. In: Proc. 19th CCC, pp. 223–235 (2004)

4. Bohossian, V., Riedel, M.D., Bruck, J.: Trading Weight Size for Circuit Depth: An LT2 Circuit for Comparison, Tech. Report of PARADISE, ETR028 (1998), Available at http://www.paradise.caltech.edu/~riedel/research/lt2comp.html

5. Forster, J.: A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. J. Comput. Syst. Sci. 65, 612–625 (2002)

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

1. On Algebraic Constructions of Neural Networks with Small Weights;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26

2. A Short List of Equalities Induces Large Sign-Rank;SIAM Journal on Computing;2022-06

3. On the relationship between energy complexity and other boolean function measures;Journal of Combinatorial Optimization;2021-01-07

4. On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function;Language and Automata Theory and Applications;2020

5. On the Relationship Between Energy Complexity and Other Boolean Function Measures;Lecture Notes in Computer Science;2019