Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems.

Gábor Kusper Csaba Biró Tamás Balla

Published in: SACI (2020)

Keyphrases

directed graph
sat problem
random walk
satisfiability problem
sat solvers
constraint satisfaction problems
directed acyclic graph
phase transition
np complete
undirected graph
stochastic local search
machine learning
bayesian networks
computational complexity
graph structure
sat solving