Algorithmic issues of AND-decomposition of Boolean formulas

DOI10.1134/S0361768815030032MaRDI QIDQ300345zbMATH OpenOpenAlexWikidataFDO

Authors Pavel Emelyanov, Denis Ponomaryov

Publication date 27 June 2016

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0361768815030032

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On tractability of disjoint 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
• The complexity of modular decomposition of Boolean functions

Cites work

• scientific article; zbMATH DE number 5785317 (Why is no real title available?)
• Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition
• Modern computer algebra
• On decidability of the decomposability problem for finite theories
• On decomposability in logical calculi
• On the relation between polynomial identity testing and finding variable disjoint factors
• The complexity of modular decomposition of Boolean functions

Cited in

(8)

• On tractability of disjoint AND-decomposition of Boolean formulas
• Factorization of Boolean polynomials: parallel algorithms and experimental evaluation
• AND-decomposition of Boolean polynomials with prescribed shared variables
• Progression of decomposed local-effect action theories
• The complexity of AND-decomposition of Boolean functions
• Decomposable collections of sets
• Biabduction (and related problems) in array separation logic
• On decomposability and interaction functions

This page was built for publication: Algorithmic issues of AND-decomposition of Boolean formulas

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