Better upper bounds on the QOBDD size of integer multiplication (Q2370421): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.1016/j.dam.2006.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065197237 / 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: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems / 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: Finding the optimal variable ordering for binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the OBDD-representation of general Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4388806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Integer Multiplication with Read-Once Branching Programs / 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: 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: BDDs -- design, analysis, complexity, and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the OBDD-size of integer multiplication via universal hashing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:35, 26 June 2024

scientific article
Language Label Description Also known as
English
Better upper bounds on the QOBDD size of integer multiplication
scientific article

    Statements

    Better upper bounds on the QOBDD size of integer multiplication (English)
    0 references
    0 references
    0 references
    26 June 2007
    0 references
    0 references
    ordered binary decision diagram
    0 references
    integer multiplication
    0 references
    upper bounds
    0 references
    0 references