Functional approach for Hamiltonian Circuit and graph isomorphism problems
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XVII, Tome 373 (2009), pp. 290-294
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{ZNSL_2009_373_a17,
author = {R. T. Faizullin},
title = {Functional approach for {Hamiltonian} {Circuit} and graph isomorphism problems},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {290--294},
publisher = {mathdoc},
volume = {373},
year = {2009},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2009_373_a17/}
}
R. T. Faizullin. Functional approach for Hamiltonian Circuit and graph isomorphism problems. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XVII, Tome 373 (2009), pp. 290-294. http://geodesic.mathdoc.fr/item/ZNSL_2009_373_a17/