Pages that link to "Item:Q1410965"

The following pages link to Towards an algebraic theory of Boolean circuits. (Q1410965):

Displaying 50 items.

• Generalized counting constraint satisfaction problems with determinantal circuits (Q472444) (← links)
• Coherence for modalities (Q531368) (← links)
• Derived semidistributive lattices (Q607453) (← links)
• The calculus of signal flow diagrams. I: Linear relations on streams. (Q729807) (← links)
• Termination orders for 3-polygraphs (Q817890) (← links)
• Tensor network contractions for \#SAT (Q887094) (← links)
• Polygraphic resolutions and homology of monoids (Q1008743) (← links)
• A simplicial foundation for differential and sector forms in tangent categories (Q1630584) (← links)
• Holographic software for quantum networks (Q1635844) (← links)
• Finite generating sets for reversible gate sets under general conservation laws (Q1682853) (← links)
• Quon language: surface algebras and Fourier duality (Q1736244) (← links)
• A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
• Some properties of inclusions of multisets and contractive Boolean operators (Q2017048) (← links)
• Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} (Q2055955) (← links)
• Universal gates with wires in a row (Q2114796) (← links)
• Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories (Q2122211) (← links)
• Quantum algorithm for K-nearest neighbors classification based on the categorical tensor network states (Q2239456) (← links)
• Proof diagrams for multiplicative linear logic: syntax and semantics (Q2331072) (← links)
• Algebra and geometry of rewriting (Q2463397) (← links)
• The three dimensions of proofs (Q2498912) (← links)
• Two polygraphic presentations of Petri nets (Q2503322) (← links)
• Termination orders for three-dimensional rewriting (Q2504386) (← links)
• Intensional Properties of Polygraphs (Q2870314) (← links)
• Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
• The structure of first-order causality (Q3081323) (← links)
• Coquet: A Coq Library for Verifying Hardware (Q3100217) (← links)
• Strongly Universal Reversible Gate Sets (Q3186604) (← links)
• Directed Homotopy in Non-Positively Curved Spaces (Q3300792) (← links)
• (Q3384926) (← links)
• (Q3384946) (← links)
• The Category TOF (Q3385627) (← links)
• Properties of co-operations: diagrammatic proofs (Q4649462) (← links)
• Open-graphs and monoidal theories (Q4917191) (← links)
• Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits (Q4922073) (← links)
• Coherence of Gray Categories via Rewriting (Q4993341) (← links)
• (Q5013809) (← links)
• (Q5014804) (← links)
• DisCoPy: Monoidal Categories in Python (Q5019676) (← links)
• (Q5019680) (← links)
• (Q5028464) (← links)
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure (Q5058366) (← links)
• String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
• Refinement for signal flow graphs (Q5111638) (← links)
• A Programming Language for Spatial Distribution of Net Systems (Q5166761) (← links)
• Transitive action on finite points of a full shift and a finitary Ryan’s theorem (Q5376550) (← 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)