An efficient local search method for random 3-satisfiability

DOI10.1016/S1571-0653(04)00463-9zbMath1179.68147MaRDI QIDQ3439117

Sakari Seitz, Pekka Orponen

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

Analysis of local search landscapes for \(k\)-SAT instances

Uses Software

• Walksat

Cites Work

• Optimization by Simulated Annealing
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• On the depth of combinatorial optimization problems
• Computer search for small complete caps
• Experimental results on the crossover point in random 3-SAT
• Combinatorial Landscapes
• Coloring Random Graphs
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Many hard examples for resolution
• Sharp thresholds of graph properties, and the $k$-sat problem
• Determining computational complexity from characteristic ‘phase transitions’
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient local search method for random 3-satisfiability