On the accuracy and running time of GSAT

02/04/2000
by   Deborah East, et al.
0

Randomized algorithms for deciding satisfiability were shown to be effective in solving problems with thousands of variables. However, these algorithms are not complete. That is, they provide no guarantee that a satisfying assignment, if one exists, will be found. Thus, when studying randomized algorithms, there are two important characteristics that need to be considered: the running time and, even more importantly, the accuracy --- a measure of likelihood that a satisfying assignment will be found, provided one exists. In fact, we argue that without a reference to the accuracy, the notion of the running time for randomized algorithms is not well-defined. In this paper, we introduce a formal notion of accuracy. We use it to define a concept of the running time. We use both notions to study the random walk strategy GSAT algorithm. We investigate the dependence of accuracy on properties of input formulas such as clause-to-variable ratio and the number of satisfying assignments. We demonstrate that the running time of GSAT grows exponentially in the number of variables of the input formula for randomly generated 3-CNF formulas and for the formulas encoding 3- and 4-colorability of graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2020

Are You Satisfied by This Partial Assignment?

Many procedures for SAT and SAT-related problems – in particular for tho...
research
10/07/2021

Faster algorithm for Unique (k,2)-CSP

In a (k,2)-Constraint Satisfaction Problem we are given a set of arbitra...
research
01/23/2021

Hard satisfiable formulas for DPLL algorithms using heuristics with small memory

DPLL algorithm for solving the Boolean satisfiability problem (SAT) can ...
research
08/04/2020

Erratum: Fast and Simple Horizontal Coordinate Assignment

We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD 20...
research
03/25/2019

Faster Random k-CNF Satisfiability

We describe an algorithm to solve the problem of Boolean CNF-Satisfiabil...
research
08/12/2021

CNF Satisfiability in a Subspace and Related Problems

We introduce the problem of finding a satisfying assignment to a CNF for...
research
09/07/2021

Impatient PPSZ – a Faster algorithm for CSP

PPSZ is the fastest known algorithm for (d,k)-CSP problems, for most val...

Please sign up or login with your details

Forgot password? Click here to reset