U. SchSning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the JOth Annual Symposium on Foundations of Computer Science, New York City, NY, 17-19 October 1999. IEEE Computer Society. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (3 citations) (Correct)
....have the potential for offering a systematic way of speeding up classical algorithms based on random walks. Well known examples of algorithms based on random walks include algorithms for 2 Satisfiability, Graph Connectivity, and probability amplification (see, e.g. 25] Recently, SchSning [29] discovered a random walk based al (a) time (b) c) time t l 1 2 1 f2 1 42 q o o 1 42 1 42 1 42 1 f2 1 42 0 0 1 Figure 1: The dynamics of the Hadamard walk. In (a) we begin at time t with a particle in chirality state RIGHT or LEFT. The result of the Hadamard ....
U. SchSning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the JOth Annual Symposium on Foundations of Computer Science, New York City, NY, 17-19 October 1999. IEEE Computer Society.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC