Area-time tradeoffs for bilinear forms computations in VLSI (Q1087015): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bruno Codenotti / rank
Normal rank
 
Property / author
 
Property / author: Grazia Lotti / rank
Normal rank
 
Property / author
 
Property / author: Bruno Codenotti / rank
 
Normal rank
Property / author
 
Property / author: Grazia Lotti / rank
 
Normal rank
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/0020-0190(86)90052-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969879412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area—Time Optimal VLSI Circuits for Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-time tradeoff for rectangular matrix multiplication in VLSI models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-time tradeoffs for matrix multiplication and related problems in VLSI models / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:19, 17 June 2024

scientific article
Language Label Description Also known as
English
Area-time tradeoffs for bilinear forms computations in VLSI
scientific article

    Statements

    Area-time tradeoffs for bilinear forms computations in VLSI (English)
    0 references
    1986
    0 references
    0 references
    area-time complexity
    0 references
    VLSI model
    0 references
    lower bound
    0 references
    0 references
    0 references
    0 references