A Theoretical Analysis of Search in GSAT

DOI10.1007/978-3-642-02777-2_26zbMath1247.68261OpenAlexW1484932675MaRDI QIDQ3637172

E. S. Skvortsov

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_26

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas

Cites Work

• Algorithms for the maximum satisfiability problem
• On the greedy algorithm for satisfiability
• Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
• SAT local search algorithms: Worst-case study
• Unnamed Item
• Unnamed Item