AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables
From MaRDI portal
Publication:2795943
DOI10.1007/978-3-319-29221-2_14zbMath1437.06023OpenAlexW2400529989MaRDI QIDQ2795943
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_14
combinatorial optimizationfactoring polynomials over finite fieldsdisjoint decompositionAND-decomposition of Boolean functionssharing prescribed variables between decomposition components
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Boolean functions (06E30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithmic issues of AND-decomposition of Boolean formulas
- Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition
- Equivalence of polynomial identity testing and polynomial factorization
- The complexity of modular decomposition of Boolean functions
- Modern Computer Algebra
- On Tractability of Disjoint AND-Decomposition of Boolean Formulas
- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors