The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...
This course teaches commonly used approximation methods in quantum mechanics. They include time-independent perturbation theory, time-dependent perturbation theory, tight binding method, variational ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results