Código QR (código de barras bidimensional)

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...

ver descrição completa

Na minha lista:
Autor principal: Konstantin I. Chukharev
Formato: Artigo
Idioma:Inglês
Publicado em: ITMO University 2020-12-01
coleção:Научно-технический вестник информационных технологий, механики и оптики
Assuntos:
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
Acesso em linha:https://ntv.ifmo.ru/file/article/20008.pdf
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registros relacionados