|
|
|
|
References
|
|
| |
| 1. |
Shevchenko V. N., “O rasshifrovke porogovykh funktsii mnogoznachnoi logiki”, Kombinatorno-algebraich. metody v prikl. matem., Gorkovskii gos. un-t, Gorkii, 1987, 155–163 |
| 2. |
Hegedüs T., “Geometrical concept learning and convex polytopes”, Proc. 7th Ann. ACM Conf. Comput. Learning Theory, ACM Press, New York, 1994, 228–236  |
| 3. |
Zolotykh N. Yu., Shevchenko V. N., “Rasshifrovka porogovykh funktsii $k$-znachnoi logiki”, Diskretnyi analiz i issl. operatsii, 2:3 (1995), 18–23  |
| 4. |
Shevchenko V. N., “O nekotorykh funktsiyakh mnogoznachnoi logiki, svyazannykh s tselochislennym programmirovaniem”, Metody diskretnogo analiza v teorii grafov i skhem, 42, In-t matem. SO AN SSSR, Novosibirsk, 1985, 99–108 |
| 5. |
Nechiporuk E. I., “O sinteze skhem iz porogovykh elementov”, Probl. kibernetiki, 11, Nauka, M., 1964, 49–62 |
| 6. |
Veselov S. I., Nizhnyaya otsenka srednego chisla neprivodimykh i krainikh tochek v dvukh zadachakh diskretnogo programmirovaniya, Dep. v VINITI № 619-84, 1984 |
| 7. |
Shevchenko V. N., Kachestvennye voprosy tselochislennogo programmirovaniya, Fizmatgiz, M., 1995  |
| 8. |
Ansel Zh., “O chisle monotonnykh bulevykh funktsii $n$ peremennykh”, Kibernetich. sb. Nov. ser., 5, Mir, M., 1968, 53–57 |
| 9. |
Antony M., Brightwell G., Cohen D., Shawe-Taylor J., “On exact specification by examples”, Proc. 5th Ann. ACM Conf. Comput. Learning Theory, ACM Press, New York, 1992, 311–318 |
