Parallelizing local search for CNF satisfiability using vectorization and PVM

DOI10.1145/944618.944620MaRDI QIDQ5463427zbMATH OpenOpenAlexFDO

Authors Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto, Kazuo Iwama

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL http://www.jea.acm.org/2002/IwamaSatisfiability/

zbMATH Keywords

class scheduling problemSAT encoding

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 5510692
• scientific article; zbMATH DE number 1941180
• scientific article; zbMATH DE number 1884354
• A fast parallel SAT-solver -- efficient workload balancing
• A parallelization scheme based on work stealing for a class of SAT solvers

Cited in

(3)

• Exploiting partial knowledge of satisfying assignments
• Criticality and parallelism in GSAT
• scientific article; zbMATH DE number 1884354 (Why is no real title available?)

Describes a project that uses

Uses Software

• Walksat

This page was built for publication: Parallelizing local search for CNF satisfiability using vectorization and PVM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463427)