Results 221 to 230 of about 158,681 (246)

A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments

Journal of Algorithms, 1993
Summary: We propose a parallel algorithm which reduces the problem of computing Hamiltonian cycles in tournaments to the problem of computing Hamiltonian paths. The running time of our algorithm is \(O(\log n)\) using \(O(n^2/\log n)\) processors on a CRCW PRAM, and \(O(\log n \log \log n)\) on an EREW PRAM using \(O(n^2/ \log n \log \log n ...
Bampis, E., El Haddad, M., Manoussakis, Y., Santha, M.   +3 more
openaire   +1 more source

Hamiltonian path integrals

2011
The properties of path integrals associated with the allowance for nonstandard terms reflecting the operator nature of the canonical variables are considered. Rules for treating such terms (''equivalence rules'') are formulated. Problems with a boundary, the behavior of path integrals under canonical transformations, and the problem of quantization of ...
openaire   +1 more source

Path Integrals for Pseudo-Hermitian Hamiltonians

International Journal of Theoretical Physics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Hamiltonian Operators via Feynman Path Integrals

Journal of Mathematical Physics, 1970
It is shown that Kerner and Sutcliffe's derivation leading to a unique quantum mechanical Hamiltonian from its classical counterpart is indeed not unique. This is done by using the same method as Kerner and Sutcliffe to derive different quantum Hamiltonians from the same classical Hamiltonian.
openaire   +1 more source

PATH INTEGRALS FOR QUASI-HERMITIAN HAMILTONIANS

International Journal of Modern Physics D, 2011
Inner products in quasi-Hermitian quantum theories, and hence probabilities, are defined through a metric that depends on the details of the Hamiltonians themselves. We shall see that the functional integral for quasi-Hermitian theories, and hence Feynman diagrams, for example, can be calculated without needing to evaluate the metric. The reason turns
openaire   +1 more source

The Hamiltonian alternating path problem

2012
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a ...
Gorbenko, Anna, Popov, Vladimir
openaire   +2 more sources

Path Integrals and Hamiltonians

2014
Providing a pedagogical introduction to the essential principles of path integrals and Hamiltonians, this book describes cutting-edge quantum mathematical techniques applicable to a vast range of fields, from quantum mechanics, solid state physics, statistical mechanics, quantum field theory, and superstring theory to financial modeling, polymers ...
openaire   +1 more source

Hamiltonian path in permutation graphs

Theoretical Computer Science
The Hamiltonian path problem is NP-complete for general graphs. The notion of a follow-up vertex in a permutation graph is introduced in this research, with respect to its Hasse diagram. A necessary and sufficient condition is justified for the existence of a Hamiltonian path in a permutation graph in terms of the existence of a follow-up vertex ...
Krishna Daripa, Alak Kumar Datta
openaire   +1 more source

Hamiltonian paths in distance graphs

Mathematical Notes, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Hamiltonian Path

2008
openaire   +1 more source