On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions

DOI10.1016/0304-3975(94)00163-DzbMATH Open0884.68104OpenAlexW2042080708MaRDI QIDQ1367525FDOQ1367525

Authors: Akito Sakurai 

Publication date: 29 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00163-d

Recommendations

• On the complexity and depth of circuits that realize partial Boolean functions
• Mathematical Foundations of Computer Science 2005
• On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
• An improved complexity hierarchy on the depth of Boolean functions
• Approximating Boolean functions with depth-2 circuits
• The complexity of depth-3 circuits computing symmetric Boolean functions
• scientific article; zbMATH DE number 15477
• On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
• Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions

zbMATH Keywords

neural network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Learnability and the Vapnik-Chervonenkis dimension
• Enumeration of Seven-Argument Threshold Functions
• Title not available (Why is that?)
• Bounds for the computational power and learning complexity of analog neural nets
• On the capabilities of multilayer perceptrons
• Title not available (Why is that?)

This page was built for publication: On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions

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