Complexity of linear operators
From MaRDI portal
Cites work
- Boolean function complexity. Advances and frontiers.
- Complexity of tropical and MIN-plus linear prevarieties
- Efficiency of a Good But Not Linear Set Union Algorithm
- Faster all-pairs shortest paths via circuit complexity
- Finding a Minimum Circuit in a Graph
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 3396154 (Why is no real title available?)
- scientific article; zbMATH DE number 3071073 (Why is no real title available?)
- scientific article; zbMATH DE number 7650250 (Why is no real title available?)
- Lowest common ancestors in trees and directed acyclic graphs
- Max-linear systems. Theory and algorithms.
- Multiplying matrices faster than coppersmith-winograd
- Powers of tensors and fast matrix multiplication
- Recursive Star-Tree Parallel Data Structure
- Subcubic equivalences between path, matrix, and triangle problems
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Tropical complexity, Sidon sets, and dynamic programming
This page was built for publication: Complexity of linear operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860907)