Larger lower bounds on the OBDD complexity of integer multiplication (Q553298): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 06E30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5932317 / rank
 
Normal rank
Property / zbMATH Keywords
 
communication complexity
Property / zbMATH Keywords: communication complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
integer multiplication
Property / zbMATH Keywords: integer multiplication / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
ordered binary decision diagrams
Property / zbMATH Keywords: ordered binary decision diagrams / rank
 
Normal rank

Revision as of 13:09, 1 July 2023

scientific article
Language Label Description Also known as
English
Larger lower bounds on the OBDD complexity of integer multiplication
scientific article

    Statements

    Larger lower bounds on the OBDD complexity of integer multiplication (English)
    0 references
    0 references
    27 July 2011
    0 references
    communication complexity
    0 references
    computational complexity
    0 references
    integer multiplication
    0 references
    lower bounds
    0 references
    ordered binary decision diagrams
    0 references

    Identifiers