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)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Structure theory of algebraic structures (08A05)
Related Items (55)
Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories ⋮ Completeness of Nominal PROPs ⋮ A simplicial foundation for differential and sector forms in tangent categories ⋮ Holographic software for quantum networks ⋮ String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ Strongly Universal Reversible Gate Sets ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Derived semidistributive lattices ⋮ Tensor network contractions for \#SAT ⋮ Finite generating sets for reversible gate sets under general conservation laws ⋮ An axiomatic approach to differentiation of polynomial circuits ⋮ The Category TOF ⋮ DisCoPy: Monoidal Categories in Python ⋮ Free gs-monoidal categories and free Markov categories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Transitive action on finite points of a full shift and a finitary Ryan’s theorem ⋮ Unnamed Item ⋮ Towards compositional graph theory ⋮ Unnamed Item ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Unnamed Item ⋮ Coherence of Gray Categories via Rewriting ⋮ Generalized counting constraint satisfaction problems with determinantal circuits ⋮ Categories of Differentiable Polynomial Circuits for Machine Learning ⋮ Quon language: surface algebras and Fourier duality ⋮ Algebra and geometry of rewriting ⋮ Quantum algorithm for K-nearest neighbors classification based on the categorical tensor network states ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Properties of co-operations: diagrammatic proofs ⋮ Open-graphs and monoidal theories ⋮ A Programming Language for Spatial Distribution of Net Systems ⋮ Coherence for modalities ⋮ Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits ⋮ Some properties of inclusions of multisets and contractive Boolean operators ⋮ The three dimensions of proofs ⋮ Two polygraphic presentations of Petri nets ⋮ Termination orders for three-dimensional rewriting ⋮ The calculus of signal flow diagrams. I: Linear relations on streams. ⋮ Polygraphic resolutions and homology of monoids ⋮ The structure of first-order causality ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ An Explicit Framework for Interaction Nets ⋮ Coquet: A Coq Library for Verifying Hardware ⋮ Refinement for signal flow graphs ⋮ Proof diagrams for multiplicative linear logic: syntax and semantics ⋮ Intensional Properties of Polygraphs ⋮ Universal gates with wires in a row ⋮ Directed Homotopy in Non-Positively Curved Spaces ⋮ Rewriting in Gray categories with applications to coherence ⋮ Termination orders for 3-polygraphs ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
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
This page was built for publication: Towards an algebraic theory of Boolean circuits.
