Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming

Here we study linear programming applied to the random K-SAT problem, a fundamental problem in computational complexity. The K-SAT problem is to decide whether a Boolean formula with N variables and structured as a conjunction of M clauses, each being a disjunction of K variables or their negations...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	PloS one Ročník 14; číslo 4; s. e0215309
Hlavní autori:	Schawe, Hendrik, Bleim, Roman, Hartmann, Alexander K.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States Public Library of Science 19.04.2019 Public Library of Science (PLoS)
Predmet:	Algorithms Boolean algebra Complexity Computational mathematics Computer applications Computer science Computer Simulation Configurations Critical phenomena Disjunction Hardness Hardness (Materials) Integer programming Linear programming Models, Theoretical Optimization Percolation Phase Transition Phase transitions Phase transitions (Physics) Physicists Programming, Linear Solution space Statistical mechanics Statistical physics Surface hardness Theory Variables Germany
ISSN:	1932-6203, 1932-6203
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!