The nonapproximability of OBDD minimization (Q1854498): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/inco.2001.3076 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025762151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effect of local changes in the variable ordering of ordered decision diagrams / 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: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of complexity measures for PRAMs and WRAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the optimal variable ordering for binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for depth-restricted branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of constructing optimal ordered binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the transformation between different types of binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable orderings and the size of OBDDs for random partially symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/INCO.2001.3076 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:29, 16 December 2024

scientific article
Language Label Description Also known as
English
The nonapproximability of OBDD minimization
scientific article

    Statements

    The nonapproximability of OBDD minimization (English)
    0 references
    0 references
    14 January 2003
    0 references

    Identifiers