Request file

Review/Citation:  KŮRKOVÁ, Věra, SANGUINETI, M. Probabilistic Bounds on Complexity of Networks Computing Binary Classification Tasks. In: KRAJČI, S., ed. ITAT 2018: Information Technologies – Applications and Theory. Proceedings of the 18th conference ITAT 2018. Aachen: Technical University & CreateSpace Independent Publishing Platform, 2018, s. 86-91. CEUR Workshop Proceedings, V-2203. ISSN 1613-0073. Available: http://ceur-ws.org/Vol-2203/86.pdf
Requested document:  a0493926.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.