|
|
|
Publications in Math-Net.Ru |
Citations |
|
1998 |
| 1. |
V. A. Orlov, “On the complexity of the realization of functions of $k$-valued logic by schemes and formulas in functionally complete bases”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998), 78–89    |
1
|
| 2. |
V. A. Orlov, “On strongly essential systems of functions in $P_k$”, Diskr. Mat., 10:2 (1998), 120–127 ; Discrete Math. Appl., 8:3 (1998), 291–298 |
| 3. |
V. A. Orlov, “Realization of $k$-valued functions by circuits of functional elements”, Mat. Zametki, 64:3 (1998), 431–436 ; Math. Notes, 64:3 (1998), 371–376  |
|
1997 |
| 4. |
V. A. Orlov, “On the completeness of systems of finite automata”, Diskr. Mat., 9:2 (1997), 74–78 ; Discrete Math. Appl., 7:3 (1997), 273–277 |
|
1989 |
| 5. |
V. A. Orlov, “Finding probability characteristics of schemes in automaton bases”, Diskr. Mat., 1:1 (1989), 29–31 |
|
1972 |
| 6. |
V. A. Orlov, “Singularities of Shannon functions in the case of automation bases”, Mat. Zametki, 11:1 (1972), 73–82 ; Math. Notes, 11:1 (1972), 48–53 |
|
1971 |
| 7. |
V. A. Orlov, “The algorithmic unsolvability of the problem of finding the asymptotic behavior of the Shannon function in the realization of boundedly deterministic operators using networks in an arbitrary basis”, Dokl. Akad. Nauk SSSR, 196:5 (1971), 1036–1039 |
|
| Organisations |
|
| |
|
|
Contact us: