|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
1. |
S. I. Veselov, D. V. Gribanov, N. Yu. Zolotykh, A. Yu. Chirkov, “Minimizing a symmetric quasiconvex function on a two-dimensional lattice”, Diskretn. Anal. Issled. Oper., 25:3 (2018), 23–35 ; J. Appl. Industr. Math., 12:3 (2018), 587–594 |
4
|
2. |
N. Yu. Zolotykh, V. K. Kubarev, S. S. Lyalin, “Double description method over the field of algebraic numbers”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:2 (2018), 161–175 |
3
|
|
2017 |
3. |
S. I. Bastrakov, N. Yu. Zolotykh, “On the dynamic problem of computing generators of a polyhedral cone”, Vestn. Yuzhno-Ural. Gos. Un-ta. Ser. Matem. Mekh. Fiz., 9:1 (2017), 5–12 |
|
2015 |
4. |
S. Bastrakov, N. Yu. Zolotykh, “Elimination of inequalities from a facet description of a polyhedron”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015), 37–45 |
1
|
5. |
S. I. Bastrakov, N. Yu. Zolotykh, “Fast method for verifying Chernikov rules in Fourier–Motzkin elimination”, Zh. Vychisl. Mat. Mat. Fiz., 55:1 (2015), 165–172 ; Comput. Math. Math. Phys., 55:1 (2015), 160–167 |
17
|
|
2012 |
6. |
N. Yu. Zolotykh, A. Yu. Chirkov, “On an upper bound for the cardinality of a minimal teaching set of a threshold function”, Diskretn. Anal. Issled. Oper., 19:5 (2012), 35–46 |
7. |
N. Yu. Zolotykh, “New modification of the double description method for constructing the skeleton of a polyhedral cone”, Zh. Vychisl. Mat. Mat. Fiz., 52:1 (2012), 153–163 ; Comput. Math. Math. Phys., 52:1 (2012), 146–156 |
31
|
|
2011 |
8. |
S. Bastrakov, N. Yu. Zolotykh, “Application of the Quickhull algorithm's principles to the double
description method”, Num. Meth. Prog., 12:2 (2011), 232–237 |
3
|
9. |
P. N. Druzhkov, N. Yu. Zolotykh, A. N. Polovinkin, “Parallel implementation of prediction algorithm in gradient boosting trees method”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 2011, no. 10, 82–89 |
|
2005 |
10. |
A. Yu. Chirkov, V. N. Shevchenko, N. Yu. Zolotykh, “On a multicriterial problem of integer linear programming”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005), 72–84 |
2
|
|
2003 |
11. |
N. Yu. Zolotykh, “On the complexity of the solution of a class of integer linear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:1 (2003), 3–10 |
|
1999 |
12. |
N. Yu. Zolotykh, V. N. Shevchenko, “Estimating the complexity of deciphering a threshold functions in a $k$-valued logic”, Zh. Vychisl. Mat. Mat. Fiz., 39:2 (1999), 346–352 ; Comput. Math. Math. Phys., 39:2 (1999), 328–334 |
9
|
|
1998 |
13. |
N. Yu. Zolotykh, “On threshold and nearly threshold functions defined at integer points of a polytope”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:2 (1998), 40–54 |
1
|
|
1995 |
14. |
N. Yu. Zolotykh, V. N. Shevchenko, “Deciphering of threshold functions of $k$-valued logic”, Diskretn. Anal. Issled. Oper., 2:3 (1995), 18–23 |
6
|
|
Organisations |
|
|
|
|