AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables (Q2795943): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of modular decomposition of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3081619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractability of Disjoint AND-Decomposition of Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic issues of AND-decomposition of Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2882946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of polynomial identity testing and polynomial factorization / rank
 
Normal rank

Latest revision as of 15:41, 11 July 2024

scientific article
Language Label Description Also known as
English
AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables
scientific article

    Statements

    AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables (English)
    0 references
    0 references
    23 March 2016
    0 references
    AND-decomposition of Boolean functions
    0 references
    combinatorial optimization
    0 references
    disjoint decomposition
    0 references
    sharing prescribed variables between decomposition components
    0 references
    factoring polynomials over finite fields
    0 references

    Identifiers