|
|
|
Publications in Math-Net.Ru |
Citations |
|
1985 |
| 1. |
Yu. A. Mamatov, E. A. Timofeev, “Queueing systems with probabilistic priorities”, Avtomat. i Telemekh., 1985, no. 9, 159–162    |
|
1980 |
| 2. |
Yu. A. Mamatov, “A method for the synthesis of planar disjunctive normal forms for logic functions”, Zh. Vychisl. Mat. Mat. Fiz., 20:4 (1980), 1075–1077 ; U.S.S.R. Comput. Math. Math. Phys., 20:4 (1980), 281–283 |
|
1979 |
| 3. |
Yu. A. Mamatov, “On a principle for obtaining high (exponential for some parameter values) lower bounds for the complexity of disjunctive normal forms”, Dokl. Akad. Nauk SSSR, 245:5 (1979), 1054–1057 |
| 4. |
Yu. A. Mamatov, “Concerning a principle for obtaining lower bounds on the complexity of formulas”, Dokl. Akad. Nauk SSSR, 245:4 (1979), 782–784 |
|
1976 |
| 5. |
Yu. A. Mamatov, “Proof of statistical optimality of the Jablonskii–Quine–McCluskey algorithm in the problem of finding a shortest covering”, Dokl. Akad. Nauk SSSR, 229:5 (1976), 1048–1050 |
| 6. |
Yu. A. Mamatov, “Asymptotic properties of shortest coverings”, Dokl. Akad. Nauk SSSR, 229:4 (1976), 801–803 |
| 7. |
Yu. A. Mamatov, “Estimation of the number of functions of the algebra of logic that can be realized by plane disjunctive normal forms”, Zh. Vychisl. Mat. Mat. Fiz., 16:1 (1976), 170–188 ; U.S.S.R. Comput. Math. Math. Phys., 16:1 (1976), 161–179 |
|
| Organisations |
|
| |
|
|
Contact us: