On tractability of disjoint AND-decomposition of Boolean formulas

DOI10.1007/978-3-662-46823-4_8MaRDI QIDQ3455060zbMATH OpenOpenAlexFDO

Authors Pavel Emelyanov, Denis 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

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

Recommendations

• Algorithmic issues of AND-decomposition of Boolean formulas
• The complexity of AND-decomposition of Boolean functions
• AND-decomposition of Boolean polynomials with prescribed shared variables
• scientific article; zbMATH DE number 2227354
• On decomposability and interaction functions

Cited in

(7)

• Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
• The complexity of AND-decomposition of Boolean functions
• A polynomial Time Delta-Decomposition algorithm for positive DNFs
• AND-decomposition of Boolean polynomials with prescribed shared variables
• Algorithmic issues of AND-decomposition of Boolean formulas
• scientific article; zbMATH DE number 6861969 (Why is no real title available?)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas

This page was built for publication: On tractability of disjoint AND-decomposition of Boolean formulas

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