Pages that link to "Item:Q1245277"
From MaRDI portal
The following pages link to Some elementary proofs of lower bounds in complexity theory (Q1245277):
Displaying 7 items.
- On commutativity and approximation (Q799369) (← links)
- The complexity of basic complex operations (Q1148674) (← links)
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics (Q1240771) (← links)
- The complexity of vector-products (Q1243128) (← links)
- On the optimal computation of a set of symmetric and persymmetric bilinear forms (Q1257950) (← links)
- Lower bounds of the complexity of linear algebras (Q1259163) (← links)
- Algebraic and computational properties of a set of (0,1) matrices with prescribed sum (Q3679329) (← links)