Computer Science
A lower bound for monotone perceptrons
Document Type
Article
Abstract
It is proved that there is a monotone function in AC40 which requires exponential-size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH. © 1995 Springer-Verlag New York Inc.
Publication Title
Mathematical Systems Theory
Publication Date
1995
Volume
28
Issue
4
First Page
283
Last Page
298
ISSN
0025-5661
DOI
10.1007/BF01185398
Keywords
computational mathematic, monotone function, oracle separation, monotone version
Repository Citation
Green, F., "A lower bound for monotone perceptrons" (1995). Computer Science. 71.
https://commons.clarku.edu/faculty_computer_sciences/71
APA Citation
Green, F. (1995). A lower bound for monotone perceptrons. Mathematical systems theory, 28, 283-298.
COinS
