Showing results 1 to 1 of 1
Title | Author(s) | Issue Date | |
---|---|---|---|
Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units Proceeding/Conference:Proceedings of the International Joint Conference on Neural Networks | 1993 |