|
|
|
Publications in Math-Net.Ru |
Citations |
|
1996 |
| 1. |
A. E. Andreev, I. A. Vikhlyantsev, “О сложности нумеpующих опеpатоpов”, Diskr. Mat., 8:4 (1996), 44–56    ; Discrete Math. Appl., 6:6 (1996), 549–561 |
|
1994 |
| 2. |
A. E. Andreev, I. A. Vikhlyantsev, “Estimates for the length of a code for schemes consisting of functional elements”, Diskr. Mat., 6:4 (1994), 10–20 ; Discrete Math. Appl., 4:6 (1994), 579–588 |
1
|
| 3. |
I. A. Vikhlyantsev, “On realization of partitions of sets by circuits of functional elements”, Diskr. Mat., 6:3 (1994), 61–72 ; Discrete Math. Appl., 4:5 (1994), 421–431 |
|
1990 |
| 4. |
I. A. Vikhlyantsev, “Self-correction for buffer switching circuits”, Diskr. Mat., 2:1 (1990), 80–86 |
|
1989 |
| 5. |
I. A. Vikhlyantsev, “Realization of systems of conjunctions by means of switching circuits”, Diskr. Mat., 1:4 (1989), 3–11 |
1
|
|
Contact us: