Methods of pseudoconvex programming with parameterization of directions and approximation of sets
Zabotin, Igor Yaroslavich, 2009, Doctor of Sciences dissertation
Kazan State University, Kazan
294 pp.
More works in this specialty
- Solving the problem of separability of algorithmically decidable cases of A-completeness for bases of Post of definite automata
Zhuk, Dmitrii Nikolaevich · 2009 · Candidate of Sciences · Lomonosov Moscow State University (MSU)
- On the nonexistence of binary codes under various conditions of uniform distribution
Yarykina, Maria Sergeyevna · 2008 · Candidate of Sciences · Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
- Chromatic numbers of layered graphs
Berlov, Sergei L'vovich · 2008 · Candidate of Sciences · P.G. Demidov Yaroslavl State University
- On probabilities of values of random Boolean expressions
Yashunskiy, Aleksey Dmitrievich · 2006 · Candidate of Sciences
- Limit theorems for some random combinatorial structures
Cherepanova, Elena Vladimirovna · 2004 · Candidate of Sciences