Work

Complexity of several constraint-satisfaction problems using the heuristic classical algorithm WalkSAT

Year: 2011

Type: article

Abstract: We determine the complexity of several constraint-satisfaction problems using the heuristic algorithm WalkSAT. At large sizes N, the complexity increases exponentially with N in all cases. Perhaps surprisingly, out of all the models studied, the hardest for WalkSAT is the one for which there is a polynomial time algorithm.

Source: Physical Review E

DOI: 10.1103/physreve.84.011102

Authors: Marco Guidetti, A. P. Young

Institutions: University of California, Santa Cruz, University of Ferrara, Istituto Nazionale di Fisica Nucleare, Sezione di Ferrara

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Army Research Office

OpenAlex ID: W1996335051

FWCI: 2.953

Cites: 16

Cited by: 23

Related to: 10