Factorization of Boolean polynomials: parallel algorithms and experimental evaluation (Q2027854): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Modern Computer Algebra / 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 Tractability of Disjoint 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: On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A polynomial Time Delta-Decomposition algorithm for positive DNFs / rank | |||
Normal rank |
Revision as of 20:00, 25 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Factorization of Boolean polynomials: parallel algorithms and experimental evaluation |
scientific article |
Statements
Factorization of Boolean polynomials: parallel algorithms and experimental evaluation (English)
0 references
28 May 2021
0 references
0 references
0 references