Nearest neighbor representations of Boolean functions
Lower and upper bounds are given for the number of prototypes required for various nearest neighbor representations of Boolean functions.
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
AAAI Press
2006
|
| Tárgyszavak: | |
| mtmt: | 2840435 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/5935 |
| LEADER | 00896naa a2200217 i 4500 | ||
|---|---|---|---|
| 001 | publ5935 | ||
| 005 | 20220922143956.0 | ||
| 008 | 151216s2006 hu o 1|| angol d | ||
| 024 | 7 | |a 2840435 |2 mtmt | |
| 040 | |a SZTE Publicatio Repozitórium |b hun | ||
| 041 | |a angol | ||
| 100 | 1 | |a Hajnal Péter | |
| 245 | 1 | 0 | |a Nearest neighbor representations of Boolean functions |h [elektronikus dokumentum] / |c Hajnal Péter |
| 260 | |a AAAI Press |c 2006 | ||
| 300 | |a P44-8 p. | ||
| 520 | 3 | |a Lower and upper bounds are given for the number of prototypes required for various nearest neighbor representations of Boolean functions. | |
| 650 | 4 | |a Matematika | |
| 700 | 0 | 1 | |a Liu Z |e aut |
| 700 | 0 | 1 | |a Turán György |e aut |
| 711 | |a 9th International Symposium on Artificial Intelligence and Mathematics |c Fort Lauderdale |d 2006.01.04-2006.01.06 | ||
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/5935/1/P44.pdf |z Dokumentum-elérés |