Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improving the variable ordering of OBDDs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of binary decision diagrams representing Boolean functions / 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: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal hashing and k-wise independent random variables via integer arithmetic without primes / 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: The computational complexity of universal hashing / 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: Reduction of OBDDs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762533 / rank
 
Normal rank

Revision as of 12:50, 11 June 2024

scientific article
Language Label Description Also known as
English
Bounds on the OBDD-size of integer multiplication via universal hashing
scientific article

    Statements

    Bounds on the OBDD-size of integer multiplication via universal hashing (English)
    0 references
    0 references
    7 December 2005
    0 references
    OBDDs
    0 references
    Integer multiplication
    0 references
    Binary decision diagrams
    0 references
    Branching programs
    0 references

    Identifiers