Pages that link to "Item:Q1151751"
From MaRDI portal
The following pages link to Area-time tradeoffs for matrix multiplication and related problems in VLSI models (Q1151751):
Displayed 12 items.
- An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh (Q685469) (← links)
- Unbounded hardware is equivalent to deterministic Turing machines (Q789180) (← links)
- Area-time tradeoff for rectangular matrix multiplication in VLSI models (Q796300) (← links)
- Area-period tradeoffs for multiplication of rectangular matrices (Q1060844) (← links)
- The performance of multilective VLSI algorithms (Q1069297) (← links)
- Communication complexity (Q1069701) (← links)
- Area-time tradeoffs for bilinear forms computations in VLSI (Q1087015) (← links)
- Area-time complexity of the unconstrained minimization problem (Q1087137) (← links)
- Communication complexity hierarchy (Q1090456) (← links)
- Area-time lower-bound techniques with applications to sorting (Q1091139) (← links)
- The communication complexity of several problems in matrix computation (Q1186508) (← links)
- The matrix equation MX + XN = B in the VLSI model (Q3799562) (← links)