Towards an algebraic theory of Boolean circuits

2003/06/30 by Yves Lafont · 15 citations
Computer Science · #Logic, programming, and type systems #Computability, Logic, AI Algorithms #semigroups and automata theory

paper · doi:10.1016/s0022-4049(03)00069-0

Cited by

• Parameterized Quantum Circuit Semantics Through Enriched Categories
• Graphical Calculus for products and convolutions
• Lectures on Quantum Tensor Networks
• One rig to control them all
• Tensor Networks in a Nutshell
• Interacting Hopf Algebras: the Theory of Linear Systems
• Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
• Finite generating sets for reversible gate sets under general\n conservation laws
• Coherence for Modalities
• Introducing Yet Another REversible Language
• Presentation of a Game Semantics for First-Order Propositional Logic
• Polygraphs for termination of left-linear term rewriting systems
• Quon language: surface algebras and Fourier duality
• Syntax for Split Preorders
• Compositional Control-Driven Boolean Circuits