Application of SAT-approach for solving combinatorial problems

MaRDI QIDQ5150489zbMATH OpenFDO

Authors

Publication date 15 February 2021

Full work available at URL http://mathnet.ru/eng/pdm323

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational aspects of satisfiability (68R07) Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27)

Recommendations

• Application of symbolic computations to the study of discrete models of some gene networks
• Technology for translating combinatorial problems into Boolean equations
• scientific article; zbMATH DE number 1630006
• scientific article; zbMATH DE number 776082
• Regular-SAT: A many-valued approach to solving combinatorial problems

Cites work

• Application of symbolic computations to the study of discrete models of some gene networks

Cited in

(5)

• The SAT+CAS method for combinatorial search with applications to best matrices
• Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
• Application of symbolic computations to the study of discrete models of some gene networks
• Enriching Solutions to Combinatorial Problems via Solution Engineering
• Technology for translating combinatorial problems into Boolean equations

This page was built for publication: Application of SAT-approach for solving combinatorial problems

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