Okolnishnikova Elizaveta Antonovna

Publications in Math-Net.Ru

1. On distributed circuits
   
   Diskretn. Anal. Issled. Oper., 18:6 (2011),  71–81
2. Lower bound for the computation complexity of BCH-codes for branching programs
   
   Diskretn. Anal. Issled. Oper., 16:5 (2009),  69–77
3. On the Number of Hamiltonian Cycles in Hamiltonian Dense Graphs
   
   Mat. Tr., 8:2 (2005),  199–206
4. On the complexity of nondeterministic branching programs that realize characteristic functions of Reed–Muller codes
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003),  67–81
5. On a method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  76–102
6. On two operations over Boolean functions
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  79–93
7. Comparison of the complexities of nondeterministic branching $k$-programs
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 6:1 (1999),  65–85
8. On the comparison of the complexities of binary $k$-programs
   
   Diskretn. Anal. Issled. Oper., 2:4 (1995),  54–73