Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen

Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Schädlich, Frank
Other Authors: Goerdt, Andreas
Format: Doctoral Thesis
Language:German
Published: 2004
Subjects:
info:eu-repo/classification/ddc/510
ddc:510
info:eu-repo/classification/ddc/004
ddc:004
Approximationstechniken
Erfüllbarkeit
probabilistic analysis
probabilistische Analyse
probabilistisches 4-SAT
probabilistisches k-SAT
random 4-SAT
random k-SAT
Hajos calculus
Hajos-Kalkül
Hypergraphdiskrepanz
Maxcut
Satisfiability
approximation techniques
hypergraph discrepancy
maximaler Schnitt
Online Access:http://nbn-resolving.de/urn:nbn:de:swb:ch1-200400959
https://monarch.qucosa.de/id/qucosa%3A18178
https://monarch.qucosa.de/api/qucosa%3A18178/attachment/ATT-0/
https://monarch.qucosa.de/api/qucosa%3A18178/attachment/ATT-1/

Similar Items

Similar Items