Exponential Time Complexity of SAT and Related Problems
Open access
Date
2010Type
- Doctoral Thesis
ETH Bibliography
yes
Altmetrics
Permanent link
https://doi.org/10.3929/ethz-a-006113172Publication status
publishedExternal links
Search print copy at ETH Library
Publisher
ETHSubject
HASH-ALGORITHMEN + HASH-FUNKTIONEN (INFORMATIONSSYSTEME); HASH ALGORITHMS + HASH-FUNCTIONS (INFORMATION SYSTEMS); ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK); ALGORITHMIC COMPLEXITY (MATHEMATICS); CONSTRAINT SATISFACTION ALGORITHMEN (GRAPHENTHEORIE); CONSTRAINT SATISFACTION ALGORITHMS (GRAPH THEORY)Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus)
More
Show all metadata
ETH Bibliography
yes
Altmetrics