Edit Profile (opens in new tab) Okol’nishnikova, Elizaveta Antonovna Author ID: okolnishnikova.elizaveta-antonovna Published as: Okol’nishnikova, E. A.; Okol’nishnikova, Elizaveta A.; Okol’nisnikova, E. A. more...less Documents Indexed: 19 Publications since 1976 Biographic References: 1 Publication Co-Authors 19 single-authored Serials 10 Metody Diskretnogo Analiza 3 Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 2 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 1 Matematicheskie Trudy Fields 15 Information and communication theory, circuits (94-XX) 11 Computer science (68-XX) 3 Combinatorics (05-XX) 2 Mathematical logic and foundations (03-XX) 2 Order, lattices, ordered algebraic structures (06-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 8 Publications have been cited 14 times in 14 Documents Cited by ▼ Year ▼ Lower estimates for the complexity of realization of characteristic functions of binary codes by binary programs. Zbl 0819.94031 Okol’nishnikova, E. A. 4 1991 A monotone Boolean system with quadratic complexity of realization in the basis \(\{\) v,&,0,1\(\}\). Zbl 0578.94029 Okol’nishnikova, E. A. 2 1984 On the influence of a type of restrictions on the complexity of schemes of functional elements. Zbl 0499.94026 Okol’nishnikova, E. A. 2 1981 On the influence of negations on the complexity of a realization of monotone Boolean functions by formulas of bounded depth. Zbl 0516.94027 Okol’nishnikova, E. A. 2 1982 On comparison of complexities of binary \(k\)-programs. Zbl 0863.68093 Okol’nishnikova, E. A. 1 1995 On lower bounds for branching programs. Zbl 0846.94023 Okol’nishnikova, E. A. 1 1991 On the number of Hamiltonian cycles in Hamiltonian dense graphs. Zbl 1249.05237 Okol’nishnikova, E. A. 1 2005 On the hierarchy of nondeterministic branching \(k\)-programs. Zbl 1507.68101 Okol’nishnikova, Elizaveta A. 1 1997 On the number of Hamiltonian cycles in Hamiltonian dense graphs. Zbl 1249.05237 Okol’nishnikova, E. A. 1 2005 On the hierarchy of nondeterministic branching \(k\)-programs. Zbl 1507.68101 Okol’nishnikova, Elizaveta A. 1 1997 On comparison of complexities of binary \(k\)-programs. Zbl 0863.68093 Okol’nishnikova, E. A. 1 1995 Lower estimates for the complexity of realization of characteristic functions of binary codes by binary programs. Zbl 0819.94031 Okol’nishnikova, E. A. 4 1991 On lower bounds for branching programs. Zbl 0846.94023 Okol’nishnikova, E. A. 1 1991 A monotone Boolean system with quadratic complexity of realization in the basis \(\{\) v,&,0,1\(\}\). Zbl 0578.94029 Okol’nishnikova, E. A. 2 1984 On the influence of negations on the complexity of a realization of monotone Boolean functions by formulas of bounded depth. Zbl 0516.94027 Okol’nishnikova, E. A. 2 1982 On the influence of a type of restrictions on the complexity of schemes of functional elements. Zbl 0499.94026 Okol’nishnikova, E. A. 2 1981 all cited Publications top 5 cited Publications all top 5 Cited by 9 Authors 5 Yukna, Stasys P. 2 Andreev, Alexander E. 2 Lingas, Andrzej 2 Okol’nishnikova, Elizaveta Antonovna 2 Sieling, Detlef 1 Gould, Ronald J. 1 Kudryavtsev, Valeriĭ Borisovich 1 Servedio, Rocco A. 1 Wegener, Ingo all top 5 Cited in 10 Serials 2 Journal of Computer and System Sciences 1 Information Processing Letters 1 Algebra and Logic 1 Graphs and Combinatorics 1 Algorithmica 1 Information and Computation 1 RAIRO. Informatique Théorique et Applications 1 Journal of Mathematical Sciences (New York) 1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 1 Lobachevskii Journal of Mathematics Cited in 4 Fields 13 Computer science (68-XX) 4 Information and communication theory, circuits (94-XX) 1 Combinatorics (05-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year