Towards an algebraic theory of Boolean circuits.

From MaRDI portal
Publication:1410965

DOI10.1016/S0022-4049(03)00069-0zbMath1037.94015MaRDI QIDQ1410965

Yves Lafont

Publication date: 15 October 2003

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (55)

Rewriting modulo isotopies in pivotal linear \((2,2)\)-categoriesCompleteness of Nominal PROPsA simplicial foundation for differential and sector forms in tangent categoriesHolographic software for quantum networksString diagram rewrite theory II: Rewriting with symmetric monoidal structureStrongly Universal Reversible Gate SetsString Diagram Rewrite Theory I: Rewriting with Frobenius StructureDerived semidistributive latticesTensor network contractions for \#SATFinite generating sets for reversible gate sets under general conservation lawsAn axiomatic approach to differentiation of polynomial circuitsThe Category TOFDisCoPy: Monoidal Categories in PythonFree gs-monoidal categories and free Markov categoriesUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemTransitive action on finite points of a full shift and a finitary Ryan’s theoremUnnamed ItemTowards compositional graph theoryUnnamed ItemConfluence of Graph Rewriting with InterfacesUnnamed ItemCoherence of Gray Categories via RewritingGeneralized counting constraint satisfaction problems with determinantal circuitsCategories of Differentiable Polynomial Circuits for Machine LearningQuon language: surface algebras and Fourier dualityAlgebra and geometry of rewritingQuantum algorithm for K-nearest neighbors classification based on the categorical tensor network statesA class of recursive permutations which is primitive recursive completeProperties of co-operations: diagrammatic proofsOpen-graphs and monoidal theoriesA Programming Language for Spatial Distribution of Net SystemsCoherence for modalitiesDiagrammatic Reasoning for Delay-Insensitive Asynchronous CircuitsSome properties of inclusions of multisets and contractive Boolean operatorsThe three dimensions of proofsTwo polygraphic presentations of Petri netsTermination orders for three-dimensional rewritingThe calculus of signal flow diagrams. I: Linear relations on streams.Polygraphic resolutions and homology of monoidsThe structure of first-order causalityKindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}An Explicit Framework for Interaction NetsCoquet: A Coq Library for Verifying HardwareRefinement for signal flow graphsProof diagrams for multiplicative linear logic: syntax and semanticsIntensional Properties of PolygraphsUniversal gates with wires in a rowDirected Homotopy in Non-Positively Curved SpacesRewriting in Gray categories with applications to coherenceTermination orders for 3-polygraphsString diagram rewrite theory III: Confluence with and without Frobenius



Cites Work


This page was built for publication: Towards an algebraic theory of Boolean circuits.