Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2019_31_2_a3,
author = {A. V. Bistrigova},
title = {Attribute-efficient learning of {Boolean} functions from {Post} closed classes},
journal = {Diskretnaya Matematika},
pages = {34--56},
publisher = {mathdoc},
volume = {31},
number = {2},
year = {2019},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2019_31_2_a3/}
}
A. V. Bistrigova. Attribute-efficient learning of Boolean functions from Post closed classes. Diskretnaya Matematika, Tome 31 (2019) no. 2, pp. 34-56. http://geodesic.mathdoc.fr/item/DM_2019_31_2_a3/
[1] Post E., “Determination of all closed systems of truth tables”, Bull. Amer. Math. Soc., 26 (1920), 437
[2] Post E., “Two-valued iterative systems of mathematical logic”, Princeton Univ. Press, Princeton, 1941 | MR | Zbl
[3] Kibkalo M. A., “Ob avtomatnoi slozhnosti klassov Posta bulevykh funktsii”, Intellektualnye sistemy, 15:(1-4) (2011), 379–400 | MR
[4] Blokhina G. N., Kudryavtsev V. B., “O spektrakh klassov Posta bulevskikh funktsii”, Intellektualnye sistemy, 14:(1-4) (2010), 279–298 | MR
[5] Chlenova T. S., “O sloistosti zamknutykh klassov bulevykh funktsii i funktsii $k$-znachnoi logiki”, Intellektualnye sistemy. Teoriya i prilozheniya, 18:1 (2014), 259–262 | MR
[6] Kalachev G. V., “Ob otsenkakh moschnosti ploskikh skhem dlya zamknutykh klassov bulevykh funktsii”, Intellektualnye sistemy. Teoriya i prilozheniya, 20:3 (2016), 52–57
[7] Komkov C. A., “Moschnosti generiruyuschikh mnozhestv po operatsiyam iz klassov reshetki Posta”, Diskretnaya matematika, 30:1 (2018), 19–38 | DOI | MR
[8] Osokin V. V., “O parallelnoi parametro-efektivnoi rasshifrovke psevdo-bulevykh funktsii”, Intellektualnye sistemy. Teoriya i prilozheniya, 14:1-4 (2000), 429–458
[9] Gasanov E. E., Niyazova Z. A., “Rasshifrovka arifmeticheskikh summ malogo chisla monotonnykh kon'yunktsii”, Mater. XI Mezhdunar. seminara Diskretnaya matematika i ee prilozheniya, Izd-vo mekh.-matem. f-ta MGU, Moskva, 2012, 335–337
[10] Niyazova Z. A., “Rasshifrovka arifmeticheskikh summ monotonnykh kon'yunktsii”, Intellektualnye sistemy. Teoriya i prilozheniya, 19:4 (2015), 169–195 | MR
[11] Damaschke P., “Adaptive versus nonadaptive attribute-efficient learning”, Machine Learning, 41 (2000), 197–215 | DOI | Zbl
[12] Osokin V. V., “On learning monotone Boolean functions with irrelevant variables”, Discrete Math. Appl., 20:3 (2010), 307–320 | DOI | DOI | MR | Zbl
[13] Uehara R., Tsuchida K., Wegener I., “Optimal attribute-efficient learning of disjunction, parity, and threshold functions”, Proc. Third Europ. Conf. Comput. Learn. Theor. EuroCOLT '97, 1997 | MR
[14] Hofmeister T., “An application of codes to attribute-efficient learning”, Proc. 4th Europ. Conf. Comput. Learn. Theor. EuroCOLT '99, 1999 | MR
[15] Gasanov E.E., “Rasshifrovka lineinykh funktsii ranzhirovaniya”, Mater. XI Mezhdunar. seminara “Diskretnaya matematika i ee prilozheniya”, Izd-vo mekh.-mat. f-ta MGU, 2012, 332–334
[16] Khegai S.I., “Rasshifrovka polinomialnykh funktsii ranzhirovaniya”, Intellektualnye sistemy, 19:1 (2015), 213–230 | MR
[17] Bshouty N. H., Cleve R., Gavalda R., Kannan S., Tamon Ch., “Oracles and queries that are sufficient for exact learning”, J. Comput. Syst. Sci., 52:3 (1996), 421–433 | DOI | MR | Zbl
[18] Angluin D., “Queries and concept learning”, Machine Learning, 2:4 (1988), 319-342 | MR
[19] Damaschke P., “On parallel attribute-efficient learning”, J. Comput. Sci., 67 (2003), 46–62 | MR | Zbl
[20] Korobkov V. K., “O monotonnykh funktsiyakh algebry logiki”, Problemy kibernetiki, 13, Nauka, Moskva, 1965
[21] Ansel Zh., “O chisle monotonnykh bulevykh funktsii ot $n$ peremennykh”, Kibernetich. sb. Novaya seriya., 5, Mir, M., 1968, 53–57
[22] Sloane N. J. A., “Covering arrays and intersecting codes.”, J. Comb. Des., 1 (1993.), 51–63 | DOI | MR | Zbl
[23] Kulyamin V.V., Petukhov A.A., “Obzor metodov postroeniya pokryvayuschikh naborov”, Programmirovanie, 37:3 (2011), 3–41 | MR
[24] Cohen D. M., Dalal S. R., Fredman M. L., Patton G. C., “The AETG System: an approach to testing based on combinatorial design”, IEEE Trans. Software Eng., 23:7 (1997), 437–444 | DOI
[25] Hartman A., “Software and hardware testing using combinatorial covering suites”, Graph Theory, Combinatorics and Algorithms, Oper. Res./Comput. Sci. Interfaces Ser., 34, Springer, Boston, MA | MR
[26] Lim W. S., Alpern S., “Minimax rendezvous on the line”, SIAM J. Control and Optim., 34 (1996), 1650–1665 | DOI | MR | Zbl
[27] Gal S., “Rendezvous search on a line”, Oper. Res., 47 (1999), 974–976 | DOI | Zbl
[28] Kleitman D.J., Spencer J., “Families of $k$-independent sets”, Discrete Mathematics, 6 (1973), 255-262 | DOI | MR | Zbl
[29] Lawrence J., Kacker R.N., Lei Y., Kuhn R., Forbes M., “A survey of binary covering arrays”, Electr. J. Comb., 18 (2011) | MR | Zbl
[30] Gargano L., Korner J., Vaccaro U., “Sperner capacities”, Graphs and Combinatorics, 9 (1993), 31–46 | DOI | MR | Zbl
[31] Sarkar K., Colbourn C.J., Bonis A.D., Vaccaro U., “Partial covering arrays: algorithms and asymptotics”, Theory Comput. Syst., 62:6 (2018), 1470–1489 | DOI | MR | Zbl
[32] Das S., Meszaros T., “A semi-random construction of small covering arrays”, Freie Universitat Berlin, Institut fur Mathematik, 2017, arXiv: 1703.05252
[33] Ilin V. A., Sadovnichii V. A., Sendov Bl. Kh., Matematicheskii analiz. Nachalnyi kurs, Izd-vo Mosk. un-ta, 1985, 662 pp. | MR