Anatoly D. Plotnikov's Publications
Home Resume Selected papers Solver

Anatoly Plotnikov's Publications

Inventions

Books

1. Discrete Mathematics, Moscow, ``New knowledge'', (1-th edition) 2005. - 288 pp. (2-nd edition) 2006. - 304 pp. (3-th edition) 2008. - 320 pp.
http://www.wnk.biz/html/ru/info26.htm
2. Mathematical programming, Minsk, ``New knowledge'', (1-th edition) 2006, (2-nd edition) 2007. - 171 pp.
http://wnk.biz/booksmart/978-985-475-242-6.html
3. Calculus of approximations, Minsk, ``New knowledge'', 2007. - 174 pp.
http://wnk.biz/booksmart/978-985-475-283-9.html
4. Problems of the class NP: Research and simulating, "LAP LAMBERT Academic Publishing'', Saarbrucken, 2011, - 152 pp.
http://www.amazon.com/Problems-of-the-class-NP/dp/3844393463/ref=sr_1_1?s=books&ie=UTF8&qid=1304997756&sr=1-1
https://www.morebooks.de/store/gb/book/problems-of-the-class-np/isbn/978-3-8443-9346-0

The Scientific Papers List

I have the Scientific Papers:

In English:

  1. About set-theoretic properties of one-way functions
    http://arxiv.org/abs/1110.3189, 2011. - 5pp.
  2. On the relationship between classes P and NP
    http://arxiv.org/abs/1109.5531, 2011. — 10 pp.
  3. Experimental algorithm for the maximum independent set problem
    Book of Abstract, 8th International Algebraic Conference in Ukraine, Lugansk, July 5---12, 2011. p.72.
  4. Encipher of information on the basis of geometrical presentations. (coauthor Petrov A.S.)
    http://lani.arxiv.org/abs/1103.5199v1 . 2011.
  5. Logical cryptoanalysis on the example of the cryptosystem DES.
    http://eprint.iacr.org/2010/053
  6. Experimental Algorithm for the Maximum Independent Set Problem.
    http://lanl.arxiv.org/abs/0706.3565.
  7. About presentation of a digraph by dim 2 poset. "Advanced Studies in Contemporary Mathematics" volume 12 (1), 2006, p. 55-60.
  8. The lower bound of the number of all-or-none DAGs. "Advanced Studies in Contemporary Mathematics" volume 12 (2), 2006, p. 323-326.
  9. A formal approach to the oDAG/POSET problem (2004)
    http://www.cumulativeinquiry.com/Problems/solut2.pdf
  10. A Logical Model of HCP. "International Journal of Mathematics and Mathematical Sciences", Vol. 26, issue 11, 2001. Hindawi Publishing Corporation.
  11. Formalization of the class of problems solvable by a nondeterministic Turing machine http://xxx.lanl.gov/abs/cs/9903012.
  12. A class of problems of NP to be worth to search an efficient solving algorithm.
    http://xxx.lanl.gov/abs/cs/9903010.
  13. Designing SAT for HCP. http://xxx.lanl.gov/abs/cs/9903006.
  14. The problems without lookahead. (manuscript)
  15. One criterion of existence of a hamiltonian cycle. "Reliable Computing journal", issue 2 , (1998), 199 - 202.
  16. About the finding of independent vertices of a graph, Journal "Kibernetika", No. 1, 1989, p. 119 - 121.
  17. Formalization of the Class of Problems Solvable by a Nondeterministic Turing Machine, "Cybernetics and Systems Analysis", Vol. 33, No. 5, (1997), 635 - 640.
  18. Set-theoretical properties of extreme combinatorial problems. "SouthWest Journal Pure and Applied Mathematics" (SWJPAM), Vol. No. 2, (1996), 11 - 28.
  19. Polynomial-time partition of a graph into cliques. "SouthWest Journal Pure and Applied Mathematics" (SWJPAM), Vol. No. 1, (1996), 16 - 21.

In Ukrainian:

  1. Using the covering trees for building a Hamiltonian cycle. Journal "Measuring and computing devices in technological processes", 2(12), 2000, Khmelnitsky, p. 143 - 146.
  2. The dual problems of combinatorial optimization. Journal "News of the VPI", No. 3, 1995, p. 55 - 58.
  3. One approach to search of a Hamiltonian cycle in a graph. Journal "News of the VPI", No. 1, 1995, p. 65 - 69.
  4. The normal form of an extreme combinatorial problems. Journal "News of the VPI", No. 3, 1994, p. 73 - 76.
  5. To a question about minimization of Boolean functions. Journal "News of the VPI", No. 2,1994, p. 89 - 92.
  6. About partition of a graph into the minimum number cliques. Journal "News of the VPI", No. 1, 1993, p. 91 - 96.

In Russian:

  1. Informally, about the problem "P vs NP".
    Bulletin of the Dalh EUNU. ¹ 7(161), issue 1, 2011, p. 326 - 327.
  2. Non-linearity of enciphering on the basis of geometrical presentations. Collection of scientific labours of the Military institute of KNU, 2011, issue 30, 2011, p. 127-130. (co-author Petrov A.S.)
  3. An analysis of possibilities in geometrical presentation of information for the tasks of information defence.
    "Modern special technique, issue 4(23), 2010 p. 80-85. (co-authors Karajanov D.F., Petrov A.S.)
  4. Construction of Boolean functions superposition
    "Collection of scientific labours of the Military institute of KNU, 2010, issue 26, p. 107-110. (coauthor Petrov A.S.).
  5. Some features of analysis of the symmetric cryptosystems
    "Information safety", 2010, No. 1(3), p. 107 - 111. (coauthor Petrov A.S.).
  6. Logical approach to the analysis of symmetric cryptosystem.
    "News of ENU in the name V. Dal", 2010, No. 3 (145), p. 311 - 319. (co-author Petrov A.S.).
  7. About complexity of algorithms and programs. 2002, 23 pp. http://homepages.compuserve.de/chasluebeck/dn/complex.rar
  8. A logical model of HCP. Journal "Discrete analysis and operations research", 2000, Novosibirsk, p. 101.
  9. Clarifying the class of the problems solvable by nondeterministic Turing machine. "Kibernetika i Sistemny Analiz", No. 5, 1997, p. 30 - 36.
  10. Some properties of the extreme combinatorial problems. In collection "Mathematical and program methods of designing information and of control systems", 1990, Penza, p. 14 - 15.
  11. About problem of a finding of independent set of the vertices in the graph. Journal "Kibernetika", No. 1, 1989, p. 119 - 121.
  12. About number of the Boolean matrices which is invariant rearrangements of lines. Journal "News of high schools. The mathematics.", No. 6, 1985, (co-author Mastiuk A.V.), pp. 1.
  13. The method of combinatorial optimization. Reports of Academy Sciences Ukraine, series "A", No. 2, 1981, pp. 4.
  14. To the minimization of bisum normal forms of the Boolean functions. Journal "Mathematical physics", issue 15, 1974 (co-author Manukyan V.A.), pp. 7.
  15. Application of interpolation to construction of minimum normal forms of the Boolean function. Scientific-technical conference "Automation of technological preparation of manufacture in engineering by means of a computer", 1973, Voroshilovgrad, (co-author Manukyan V.A.), pp. 59 - 60.
  16. About algorithms of the functional separated decomposition. Scientific-technical conference "Automation of technological preparation of manufacture in engineering by means of a computer", 1973, Voroshilovgrad, (co-author Polyakova T.D.), p. 59.
  17. The convolution of the L-functions. Scientific-technical conference "Automation of technological preparation of manufacture in engineering by means of a computer", 1973, Voroshilovgrad, p. 58 - 59.
  18. The construction of minimum normal forms of the functions of 2m-valued logic. Scientific-technical conference "Automation of technological preparation of manufacture in engineering by means of a computer", 1973, Voroshilovgrad, p. 58.
  19. About one approach to minimization of the Boolean functions. Scientific-technical conference "Automation of technological preparation of manufacture in engineering by means of a computer", 1973, Voroshilovgrad, p. 57 - 58.
  20. Interpolation and minimization of some classes of the Boolean functions. Scientific-technical conference "Automation of technological preparation of manufacture in engineering by means of a computer", 1973, Voroshilovgrad, (co-author Manukyan V.A.), p. 57.
  21. About separated decomposition of boolean functions. Scientific-technical conference "Development and application of the computing machinery on microelectronic base", 1973, Severodonetsk, (co-author Polyakova T.D.), p. 1.
  22. The construction of the minimum DNF of the symmetrical boolean functions. Scientific-technical conference "Development and application of the computing machinery on microelectronic base", 1973, Severodonetsk, p. 1.
  23. Interpolation of a Boolean functions and its application. The preprint of Cybernetics Institute of Academy Sciences Ukraine, 1972, (co-author Manukyan V.A.), pp. 27.
  24. The use of the Boolean functions in computing machinery. The Informational Center of Coal Ministry of Ukraine, No. 2 - 4 (149), 1972, (co-author Manukyan V.A.), pp. 6.
  25. Analytical representation of the 2m-valued logic functions. In collection: "Multiciphered elements and their application", Soviet radio, 1971, 88 - 94.
  26. Theory of consecutive discrete transducers of the information. Scientific-technical conference "Development and application of facilities of computer machinery", Severodonetsk, 1969, p. 1.
  27. The questions of the functional synthesis of discrete transducers of the information of a word - word type. Doctor's dissertation, Kharkov, 1968, pp. 160.
  28. To the synthesis of discrete transducers converters of the information. Scientific-technical conference "Application of methods of the cybernetics for the solution of problems of the control", Kharkov, 1968 (co-author Rvachov V.L.), pp. 4.
  29. The machine for the centralized control. In collection: "Computing machinery", Kiev, 1968 (co-authors Velikikh N.P., Tarasenko A.N., Tarasyuk S.F.), 3 - 6.
  30. To the discrete information transducer theory. Scientific-technical conference "Development and application of a computing facilities and of an automatics", 1968, Severodonetsk, p. 1
  31. The use of a redundant notation for digital computer. In collection: "Mechanization and automation of the control", issue 4, 1968 (co-authors Kostelyansky V.M., Rozenfeld T.K.), pp. 3
  32. The machine for the centralized control of technological process of smelting in open-hearth furnaces. In collection: "Devices and facility of automation", issue 2, 1968, (co-authors Velikikh N.P., Tarasenko A.N., Tarasyuk S.F.), pp. 4.
  33. The multichannel system for processing of signals of the frequent sensors. In collection: "Technical systems of data processing", Institute of cybernetics of Academy of Sciences of Ukraine, issue 1, 1968, (co-authors Velikikh N.P., Tarasenko A.N., Tarasyuk S.F.), pp. 12
  34. About the functional completeness for a system of logic operations which are determined on the set of m-capacity binary numbers. Journal "Devices and facility of automatics" (Kharkov State University), issue 6, 1967, p. 28 - 32.
  35. Discrete setting of the shaft by the shortest way. Journal "Devices and facility of automation", issue 5, 1965, p. 3
  36. The specialized computing device. Journal "Automatics and device-building", No. 2, 1965, (co-authors Afanasev V.A., Kazais E.B.), p. 17 - 19.
  37. The floating-point parallel-serial arithmetic unit. The report of the Research Institute of Control Computers (RICC), Severodonetsk, 1963, pp. 17.
  38. The parallel-serial computing unit. The report of the Research Institute of Control Computers (RICC), Severodonetsk, 1963, pp. 63.
  39. The floating-point arithmetic unit. The report of the Research Institute of Control Computers (RICC), Severodonetsk, 1963, pp. 12.

Home Resume Selected papers Solver


Copyright © 2002 - 2011 by Anatoly D. Plotnikov All rights reserved.

Last formatted 2011-05-18