The cost of compositionality: a high-performance implementation of string diagram composition
From MaRDI portal
Publication:6153343
Recommendations
Cites work
- scientific article; zbMATH DE number 2125662 (Why is no real title available?)
- scientific article; zbMATH DE number 7649903 (Why is no real title available?)
- A survey of graphical languages for monoidal categories
- Fast sparse matrix multiplication
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- Rewriting modulo symmetric monoidal structure
- Towards an algebraic theory of Boolean circuits.
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Wiring diagrams as normal forms for computing in symmetric monoidal categories
This page was built for publication: The cost of compositionality: a high-performance implementation of string diagram composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153343)