On a generalisation complexity measure for boolean functions

Franco, L. & Anthony, M.ORCID logo (2004). On a generalisation complexity measure for boolean functions. In Proceedings of the IEEE 2004 International Joint Conference on Neural Networks . IEEE Press.
Copy
Item Type Chapter
Copyright holders © 2004 INIST-CNRS
Departments LSE > Academic Departments > Mathematics
Date Deposited 08 Sep 2008
URI https://researchonline.lse.ac.uk/id/eprint/9827

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics