article · 2002

VC dimension in circuit complexity

Cited by 0Abstract and details only

Abstract

The main result of this paper is a /spl Omega/(n/sup 1/4/) lower bound on the size of a sigmoidal circuit computing a specific AC/sub 2//sup 0/ function. This is the first lower bound for the computation model of sigmoidal circuits with unbounded weights. We also give upper and lower bounds for the same function in a few other computation models: circuits of AND/OR gates, threshold circuits, and circuits of piecewise-rational gates.

Cite this paper

APA 7

Koiran, P. (2002). VC dimension in circuit complexity. https://doi.org/10.1109/ccc.1996.507671

MLA 9

Koiran, Pascal. “VC dimension in circuit complexity.” vol. 8, 2002, pp. 81–85, https://doi.org/10.1109/ccc.1996.507671.

Chicago

Koiran, Pascal. 2002. “VC dimension in circuit complexity.” https://doi.org/10.1109/ccc.1996.507671.

Harvard

Koiran, P. (2002) ‘VC dimension in circuit complexity’. Available at: https://doi.org/10.1109/ccc.1996.507671.

BibTeX

@article{koiran2002dimension,
  title = {{VC dimension in circuit complexity}},
  author = {Koiran, Pascal},
  volume = {8},
  pages = {81--85},
  year = {2002},
  doi = {10.1109/ccc.1996.507671}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.