Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen
The NP-complete k-SAT problem - decide wether a given formula is satisfiable - is of fundamental importance in theoretical computer science. In this dissertation we study random 4-SAT formulas with > 116 n^2 clauses. These formulas are almost surly unsatisfiable. Here we show the existence...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | deu |
| Published: |
Universitätsbibliothek Chemnitz
2004
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:swb:ch1-200400959 http://nbn-resolving.de/urn:nbn:de:swb:ch1-200400959 http://www.qucosa.de/fileadmin/data/qucosa/documents/4848/data/diss.pdf http://www.qucosa.de/fileadmin/data/qucosa/documents/4848/20040095.txt |
Search Result 1