Some elementary proofs of lower bounds in complexity theory (Q1245277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(78)90005-8 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155851636 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(78)90005-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155851636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Multiplications Required for Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of quaternion multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of vector-products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of iterated networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras Having Linear Multiplicative Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5735181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5829318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berechnung und Programm. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berechnung und Programm. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank

Latest revision as of 23:03, 12 June 2024

scientific article
Language Label Description Also known as
English
Some elementary proofs of lower bounds in complexity theory
scientific article

    Statements

    Some elementary proofs of lower bounds in complexity theory (English)
    0 references
    0 references
    0 references
    1978
    0 references
    0 references
    0 references