page_title: Boolean circuit
hierarchical_section_title: Boolean circuit
caption_attribution_description: Three input Boolean circuit diagram with example inputs and output
context_page_description: In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Boolean circuits are also used as a formal model for combinational logic in digital electronics.
  Boolean circuits are defined in terms of the logic gates they contain. For example, a circuit might contain binary AND and OR gates and unary NOT gates, or be entirely described by binary NAND gates. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit.
  Boolean circuits provide a model for many digital components used in computer engineering, including multiplexers, adders, and arithmetic logic units, but they exclude sequential logic. They are an abstraction that omits many aspects relevant to designing real digital logic circuits, such as metastability, fanout, glitches, power consumption, and propagation delay variability.
context_section_description: In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Boolean circuits are also used as a formal model for combinational logic in digital electronics.
  Boolean circuits are defined in terms of the logic gates they contain. For example, a circuit might contain binary AND and OR gates and unary NOT gates, or be entirely described by binary NAND gates. Each gate corresponds to some Boolean function that takes a fixed number of bits as input and outputs a single bit.
  Boolean circuits provide a model for many digital components used in computer engineering, including multiplexers, adders, and arithmetic logic units, but they exclude sequential logic.  They are an abstraction that omits many aspects relevant to designing real digital logic circuits, such as metastability, fanout, glitches, power consumption, and propagation delay variability.
caption: Example Boolean circuit. The 
    
      
        
          ∧
        
      
      {\displaystyle \wedge }
    
   nodes are AND gates, the 
    
      
        
          ∨
        
      
      {\displaystyle \vee }
    
   nodes are OR gates, and the 
    
      
        
          ¬
        
      
      {\displaystyle \neg }
    
   nodes are NOT gates
exif: {"Image Orientation": "Horizontal (normal)", "Image XResolution": "150", "Image YResolution": "150", "Image ResolutionUnit": "Pixels/Inch", "Image ExifOffset": "90", "EXIF ExifImageWidth": "1038", "EXIF ExifImageLength": "921"}