APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM

Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table. The solution of this problem is proposed based on its reduction to the Boolean satisfiability problem (SAT...

Ful tanımlama

Detaylı Bibliyografya

Yazar:	Konstantin I. Chukharev
Materyal Türü:	Artigo
Dil:	Inglês
Baskı/Yayın Bilgisi:	ITMO University 2020-12-01
Seri Bilgileri:	Научно-технический вестник информационных технологий, механики и оптики
Konular:	satisfiability problem (sat) incremental satisfiability problem (sat) solvers non-deterministic polynomial-time (np) hard problems constraint programming boolean formula synthesis tseytin transformations symmetry breaking kotlin framework java native interface
Online Erişim:	https://ntv.ifmo.ru/file/article/20008.pdf
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!