Monoidal Width
From MaRDI portal
Publication:6076171
DOI10.46298/lmcs-19(3:15)2023arXiv2212.13229OpenAlexW4387462436MaRDI QIDQ6076171
Elena di Lavore, Paweł Sobociński
Publication date: 23 October 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.13229
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The geometry of tensor calculus. I
- Graph minors. X: Obstructions to tree-decomposition
- S-functions for graphs
- Origins of the cohomology of groups
- Graph complexity
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- Approximating clique-width and branch-width
- On non-serial dynamic programming
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Picturing Quantum Processes
- Full Rank Factorization of Matrices
- Compositional Reachability in Petri Nets
- Decorated Cospans
- Graph minors. II. Algorithmic aspects of tree-width
- Graph expressions and graph rewritings
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Diagrammatic Semantics for Digital Circuits.
- Compositional Game Theory
- Relating structure and power: Comonadic semantics for computational resources
- Disintegration and Bayesian inversion via string diagrams
- An Invitation to Applied Category Theory
- Towards compositional graph theory
- Spined categories: generalizing tree-width beyond graphs
This page was built for publication: Monoidal Width
