Towards an algebraic theory of Boolean circuits.
From MaRDI portal
Publication:1410965
DOI10.1016/S0022-4049(03)00069-0zbMath1037.94015MaRDI QIDQ1410965
Publication date: 15 October 2003
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q42: Grammars and rewriting systems
08A05: Structure theory of algebraic structures
Related Items
Properties of co-operations: diagrammatic proofs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Open-graphs and monoidal theories, Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits, Unnamed Item, String Diagram Rewrite Theory I: Rewriting with Frobenius Structure, DisCoPy: Monoidal Categories in Python, A Programming Language for Spatial Distribution of Net Systems, Transitive action on finite points of a full shift and a finitary Ryan’s theorem, An Explicit Framework for Interaction Nets, Towards compositional graph theory, Generalized counting constraint satisfaction problems with determinantal circuits, Coherence for modalities, Derived semidistributive lattices, The calculus of signal flow diagrams. I: Linear relations on streams., Termination orders for 3-polygraphs, Tensor network contractions for \#SAT, Polygraphic resolutions and homology of monoids, A simplicial foundation for differential and sector forms in tangent categories, Holographic software for quantum networks, Finite generating sets for reversible gate sets under general conservation laws, Quon language: surface algebras and Fourier duality, A class of recursive permutations which is primitive recursive complete, Some properties of inclusions of multisets and contractive Boolean operators, Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}, Universal gates with wires in a row, Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories, Quantum algorithm for K-nearest neighbors classification based on the categorical tensor network states, Proof diagrams for multiplicative linear logic: syntax and semantics, Algebra and geometry of rewriting, The three dimensions of proofs, Two polygraphic presentations of Petri nets, Termination orders for three-dimensional rewriting, Intensional Properties of Polygraphs, Confluence of Graph Rewriting with Interfaces, The structure of first-order causality, Coquet: A Coq Library for Verifying Hardware, Strongly Universal Reversible Gate Sets, Unnamed Item, Unnamed Item, Directed Homotopy in Non-Positively Curved Spaces, The Category TOF
Cites Work
- Unnamed Item
- Unnamed Item
- Higher-dimensional word problems with applications to equational logic
- Word problems and a homological finiteness condition for monoids
- A finiteness condition for rewriting systems
- Minimality of the system of seven equations for the category of finite sets
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Church-Rooser property and homology of monoids
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
