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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-015-9657-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2186363574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of (generalized) OBDDs for threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Ordering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Width of Ordered Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact OBDD bounds for some fundamental functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the variable ordering of OBDDs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Testing Computability by Small Width OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic topological sorting with OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Testing Computability by Small Width OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Membership in Languages that Have Small Width Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing computability by width-two OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonapproximability of OBDD minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:40, 13 July 2024

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