On Tractability of Disjoint AND-Decomposition of Boolean Formulas

DOI10.1007/978-3-662-46823-4_8zbMath1434.68207OpenAlexW835412343MaRDI QIDQ3455060

P. G. Emelyanov, Denis K. Ponomaryov

Publication date: 3 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46823-4_8

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Classical propositional logic (03B05) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

The complexity of AND-decomposition of Boolean functions ⋮ Factorization of Boolean polynomials: parallel algorithms and experimental evaluation ⋮ AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables

This page was built for publication: On Tractability of Disjoint AND-Decomposition of Boolean Formulas