Pages that link to "Item:Q1410965"
From MaRDI portal
The following pages link to Towards an algebraic theory of Boolean circuits. (Q1410965):
Displaying 16 items.
- Transitive action on finite points of a full shift and a finitary Ryan’s theorem (Q5376550) (← links)
- Extensional Uniformity for Boolean Circuits (Q5390592) (← links)
- (Q5590069) (← links)
- (Q5875359) (← links)
- Rewriting in Gray categories with applications to coherence (Q5877242) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- Completeness of Nominal PROPs (Q5883754) (← links)
- An Explicit Framework for Interaction Nets (Q5902126) (← links)
- Towards compositional graph theory (Q5971395) (← links)
- An axiomatic approach to differentiation of polynomial circuits (Q6052943) (← links)
- Free gs-monoidal categories and free Markov categories (Q6102159) (← links)
- Categories of Differentiable Polynomial Circuits for Machine Learning (Q6393524) (← links)
- Free precategories as presheaf categories (Q6575458) (← links)
- String diagrams for strictification and coherence (Q6635518) (← links)
- The \textsf{ZX}\&-calculus: a complete graphical calculus for classical circuits using spiders (Q6645577) (← links)
- Termination of rewriting on reversible Boolean circuits as a free 3-category problem (Q6664060) (← links)