On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions
type: Item
instance of: scholarly article
title: On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions
zbMATH Open document ID: 0884.68104
DOI: 10.1016/0304-3975(94)00163-D
author: Akito Sakurai
published in: Theoretical Computer Science
publication date: 1997-09-29T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1065126
zbMATH Keywords: neural network
MaRDI profile type: Publication
cites work: On the capabilities of multilayer perceptrons
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Enumeration of Seven-Argument Threshold Functions
cites work: Q5659464
cites work: Bounds for the computational power and learning complexity of analog neural nets
cites work: Q5623599
full work available at URL: 0304-3975(94)00163-d
OpenAlex ID: W2042080708
Recommended article: On the complexity and depth of circuits that realize partial Boolean functions
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
Recommended article: Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Recommended article: An improved complexity hierarchy on the depth of Boolean functions
Recommended article: Approximating Boolean Functions with Depth-2 Circuits
Recommended article: The complexity of depth-3 circuits computing symmetric Boolean functions
Recommended article: Q3972115
Recommended article: On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
Recommended article: Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
description: scientific article; zbMATH DE number 1065126