Factoring Boolean functions using graph partitioning (Q2387436): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factoring logic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fanout Structure of Switching Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3124737 / rank
 
Normal rank

Latest revision as of 16:00, 10 June 2024

scientific article
Language Label Description Also known as
English
Factoring Boolean functions using graph partitioning
scientific article

    Statements

    Factoring Boolean functions using graph partitioning (English)
    0 references
    0 references
    2 September 2005
    0 references
    0 references
    Logic synthesis
    0 references
    Factoring Boolean functions
    0 references
    Graph partitioning
    0 references
    0 references