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

DOI10.1016/0304-3975(94)00163-DzbMath0884.68104OpenAlexW2042080708MaRDI QIDQ1367525

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

zbMATH Keywords

neural network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the capabilities of multilayer perceptrons
• Learnability and the Vapnik-Chervonenkis dimension
• Bounds for the computational power and learning complexity of analog neural nets
• Enumeration of Seven-Argument Threshold Functions

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