S. N. Preobrazhenskii, “Periodic Boolean functions and a lower bound for the complexity of operators”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2003, Number 2,Pages <nobr>25

JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2003 Number 2, Pages 25–28 (Mi vmumm1332)

Mathematics

Periodic Boolean functions and a lower bound for the complexity of operators

S. N. Preobrazhenskii

UDC: 519.714.4

Received: 25.10.2002

Fulltext: PDF file (529 kB)

Bibliographic databases: