On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$
A. A. Voronenko

References
1.	Voronenko A. A., “O proveryayuschikh testakh dlya bespovtornykh funktsii”, Matem. voprosy kibernetiki, 11 (2002), 163–176
2.	Kuznetsov A. V., “O bespovtornykh kontaktnykh skhemakh i bespovtornykh superpozitsiyakh funktsii algebry logiki”, Tr. MIAN, 51, 1958, 186–225
3.	Voronenko A. A., “Ob otsenke dliny proveryayuschego testa dlya nekotorykh bespovtornykh funktsii”, Prikl. matem. i informatika, 15 (2003), 85–97