Algebraic Techniques for Constructing Minimal Weight Threshold Functions

DOI10.1137/S0895480197326048MaRDI QIDQ4443074zbMATH OpenFDO

Authors Vasken Bohossian, Jehoshua Bruck

Publication date 8 January 2004

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480197326048

zbMATH Keywords

computational complexityneural networksthreshold functions

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Lower bound on weights of large degree threshold functions
• Lower bound on weights of large degree threshold functions
• On the Size of Weights for Threshold Gates
• On the power of small-depth threshold circuits
• Approximating threshold circuits by rational functions

Cited in

(8)

• On the existence of a minimum integer representation for weighted voting systems
• On the characterization of weighted simple games
• A parameterization for a class of complete games with abstention
• Partitioning points by parallel planes
• On minimum integer representations of weighted games
• scientific article; zbMATH DE number 3313265 (Why is no real title available?)
• Lower bound on weights of large degree threshold functions
• Lower bound on weights of large degree threshold functions

This page was built for publication: Algebraic Techniques for Constructing Minimal Weight Threshold Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443074)