Approximating Boolean functions by OBDDs (Q867861): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2006.04.037 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A lower bound for integer multiplication on randomized ordered read-once branching programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Hidden Weighted Bit Function for Various BDD Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Read-once projections and formal circuit verification with binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing / 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: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762533 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2006.04.037 / rank
 
Normal rank

Latest revision as of 06:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Approximating Boolean functions by OBDDs
scientific article

    Statements

    Approximating Boolean functions by OBDDs (English)
    0 references
    0 references
    19 February 2007
    0 references
    OBDD
    0 references
    communication complexity
    0 references
    approximation
    0 references

    Identifiers