On the minimization of (complete) ordered binary decision diagrams (Q503467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6674146 / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity theory
Property / zbMATH Keywords: complexity theory / rank
 
Normal rank
Property / zbMATH Keywords
 
layout problems
Property / zbMATH Keywords: layout problems / rank
 
Normal rank
Property / zbMATH Keywords
 
nonuniform finite automata
Property / zbMATH Keywords: nonuniform finite automata / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-completeness
Property / zbMATH Keywords: NP-completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
ordered binary decision diagrams
Property / zbMATH Keywords: ordered binary decision diagrams / rank
 
Normal rank

Revision as of 00:57, 1 July 2023

scientific article
Language Label Description Also known as
English
On the minimization of (complete) ordered binary decision diagrams
scientific article

    Statements

    On the minimization of (complete) ordered binary decision diagrams (English)
    0 references
    0 references
    12 January 2017
    0 references
    complexity theory
    0 references
    layout problems
    0 references
    nonuniform finite automata
    0 references
    NP-completeness
    0 references
    ordered binary decision diagrams
    0 references

    Identifiers