|
Zapiski Nauchnykh Seminarov POMI, 2009, Volume 373, Pages 290–294
(Mi znsl3588)
|
|
|
|
Functional approach for Hamiltonian Circuit and graph isomorphism problems
R. T. Faizullin Omsk State Technical University, Russia
Abstract:
The aim of this work is to establish relation between well-known basic problems of cryptanalysis as Hamiltonian Circuit and graph isomorphism problems and global optimization problem for classes of functionals constructed as sums of low dimensional polynomials. Bibl. – 2 titles.
Key words and phrases:
Hamiltonian circuit, graph isomorphism, optimiztion problem, polynomial functional.
Received: 21.09.2009
Citation:
R. T. Faizullin, “Functional approach for Hamiltonian Circuit and graph isomorphism problems”, Representation theory, dynamical systems, combinatorial methods. Part XVII, Zap. Nauchn. Sem. POMI, 373, POMI, St. Petersburg, 2009, 290–294; J. Math. Sci. (N. Y.), 168:3 (2010), 475–477
Linking options:
https://www.mathnet.ru/eng/znsl3588 https://www.mathnet.ru/eng/znsl/v373/p290
|
Statistics & downloads: |
Abstract page: | 203 | Full-text PDF : | 73 | References: | 41 |
|