Algorithms And Complexity

← Back to Domain-Specific Abstractions by Domain

1 domain-specific abstractions whose origin domain is Algorithms And Complexity.

• Computational complexity of matrix multiplication — The asymptotic resources required to multiply matrices, summarized algebraically by the smallest feasible exponent and operationally by finite-size costs and stability.