BOOK-CHAPTER
Solving hard combinatorial problems with GSAT — A case study
Year: 1996 Lecture notes in computer science Pages: 107-119 Publisher: Springer Science+Business Media
Keywords:
Computer science Satisfiability Boolean satisfiability problem Transformation (genetics) Graph Theoretical computer science
Metrics
7
Cited By
1.12
FWCI (Field Weighted Citation Impact)
13
Refs
0.76
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Constraint Satisfaction and Optimization
Physical Sciences → Computer Science → Computer Networks and Communications
Formal Methods in Verification
Physical Sciences → Computer Science → Computational Theory and Mathematics
Logic, Reasoning, and Knowledge
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
BOOK-CHAPTER
Solving Hard Combinatorial Optimization Problems with PyQASP
Damiano AzzoliniNicola LeoneGiuseppe MazzottaFrancesco Ricca
Lecture notes in computer science Year: 2026 Pages: 199-217
DISSERTATION
Solving hard combinatorial optimization problems in parallel: two case studies
University: Repository for Publications and Research Data (ETH Zurich) Year: 1997
BOOK-CHAPTER
Using Parallel SAT Solving to Study Hard Combinatorial Problems Associated with Boolean Circuits
Viktor V. KondratievStepan KochemazovAlexander Semenov
Communications in computer and information science Year: 2023 Pages: 123-136