Login / Signup
Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity.
Pawel Wocjan
Dominik Janzing
Thomas Beth
Published in:
Quantum Inf. Comput. (2002)
Keyphrases
</>
graph theoretical
graph theory
worst case
pairwise
upper bound
lower bound
information systems
computational complexity
tight bounds
genetic algorithm
artificial intelligence
social networks
graph coloring
error tolerance