Algorithmic issues of AND-decomposition of Boolean formulas
From MaRDI portal
Publication:300345
DOI10.1134/S0361768815030032zbMath1339.94099OpenAlexW804677561WikidataQ122911623 ScholiaQ122911623MaRDI QIDQ300345
P. G. Emelyanov, Denis K. 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Progression of Decomposed Local-Effect Action Theories ⋮ Factorization of Boolean polynomials: parallel algorithms and experimental evaluation ⋮ AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables
Cites Work
- Unnamed Item
- Unnamed Item
- On decidability of the decomposability problem for finite theories
- Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition
- The complexity of modular decomposition of Boolean functions
- Modern Computer Algebra
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
This page was built for publication: Algorithmic issues of AND-decomposition of Boolean formulas
