Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on time-space tradeoffs for computing continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting Graphs and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs on the FFT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic properties in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank

Latest revision as of 05:10, 13 June 2024

scientific article
Language Label Description Also known as
English
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
scientific article

    Statements

    Time-space tradeoffs for computing functions, using connectivity properties of their circuits (English)
    0 references
    0 references
    1980
    0 references
    0 references
    super concentrator
    0 references
    grate
    0 references
    polynomial multiplication
    0 references
    convolution
    0 references
    pebble game
    0 references
    discrete Fourier transform
    0 references
    0 references