Author:
Okol’nishnikova Elizaveta A.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Babai, L., Pudlák, P., Rödl, V., Szemerédi, M.: Lower bounds to the complexity of symmetric Boolean functions. Theoretical Computer Science 74, 313–324 (1990)
2. Bollig, B., Sauerhoff, M., Wegener, I.: On the nonappoximability on boolean functions by OBDD and read-k-times branching programs. Information and Computation 178, 263–278 (2002)
3. Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3(1), 1–18 (1993)
4. MacWilliams, F.J., Sloane, N.J.F.: The theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
5. Nečiporuk, E.: On a Boolean function. Soviet Math. Doklady 7, 999–1000 (1966)