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

Full description

Saved in:

Bibliographic Details
Published in:	PloS one Vol. 14; no. 4; p. e0215309
Main Authors:	Schawe, Hendrik, Bleim, Roman, Hartmann, Alexander K.
Format:	Journal Article
Language:	English
Published:	United States Public Library of Science 19.04.2019 Public Library of Science (PLoS)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!