|
|
|
Publications in Math-Net.Ru |
Citations |
|
1989 |
| 1. |
N. R. Emel'yanov, “Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic”, Diskr. Mat., 1:2 (1989), 65–77    |
|
1986 |
| 2. |
N. R. Emel'yanov, “One approach to construction of effective algorithms for recognizing completeness in multivalued logics”, Mat. Zametki, 39:5 (1986), 766–775 ; Math. Notes, 39:5 (1986), 418–423  |
1
|
|
1985 |
| 3. |
N. R. Emel'yanov, “Complexity of the problem of expressibility in many-valued logics”, Dokl. Akad. Nauk SSSR, 282:3 (1985), 525–529 |
| 4. |
V. B. Alekseev, N. R. Emel'yanov, “A method of constructing fast algorithms in the $k$-valued logic”, Mat. Zametki, 38:1 (1985), 148–156 ; Math. Notes, 38:1 (1985), 595–600 |
5
|
|
Contact us: