Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
A lower bound for perceptrons and an oracle separation of the PP/sup PH/ hierarchy
By: Ulfberg, S.; Berg, C.;
1997 / IEEE / 0-8186-7907-7
This item was taken from the IEEE Periodical ' A lower bound for perceptrons and an oracle separation of the PP/sup PH/ hierarchy ' We show that there are functions computable by linear size boolean circuits of depth k that require superpolynomial size perceptrons of depth k-1, for k