Random walk algorithms for SAT and constraint satisfaction problems

Download
Text (PDF, 508.1Kb)
Thumbnail
Open access
Author
Schneider, Stefan
Date
2010
Type
    Master Thesis
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-006154476
Publication status
published
Publisher
Eidgenössische Technische Hochschule Zürich, Department of Computer Science, Institute of Theoretical Computer Science
Subject
PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; RANDOM WALKS (WAHRSCHEINLICHKEITSRECHNUNG); CONSTRAINT SATISFACTION ALGORITHMEN (GRAPHENTHEORIE); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; RANDOM WALKS (PROBABILITY THEORY); CONSTRAINT SATISFACTION ALGORITHMS (GRAPH THEORY)
Organisational unit
02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science
Notes
Master thesis, Eidgenössische Technische Hochschule Zürich, 2010.
More
Show all metadata
ETH Bibliography
yes
Altmetrics