About: Boolean circuit

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Boolean circuit Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Person, within Data Space : el.dbpedia.org associated with source document(s)

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 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.

Attributes	Values
rdf:type	Thing person
rdfs:label	Boolean circuit (en)
rdfs:comment	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 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. (en)
rdfs:seeAlso	Circuit complexity
sameAs	Boolean circuit Boolean circuit
dbp:wikiPageUsesTemplate	dbt:Main_article dbt:Reflist dbt:Rp dbt:See_also dbt:Short_description dbt:Digital_electronics
Subject	Computational complexity theory Digital circuits Logic in computer science
thumbnail	wiki-commons:Special:FilePath/Three_input_Boolean_circuit.jpg?width=300
foaf:depiction
gold:hypernym	Model
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Boolean_circuit?oldid=1071851604&ns=0
Wikipage page ID	7087423 (xsd:integer)
page length (characters) of wiki page	8487 (xsd:nonNegativeInteger)
Wikipage revision ID	1071851604 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal language Logic gate NAND gate NC (complexity) NP-completeness OR gate Propositional formula Unary operation AC (complexity) AND gate Adder (electronics) Advice (complexity) Arithmetic logic unit Binary function Bit Logic gate Boolean expression Boolean function Sequential logic Turing machine Computational complexity theory Digital circuits Logic in computer science Digital data Directed acyclic graph Metastability (electronics) P-complete P/poly P (complexity) P versus NP problem Power optimization (EDA) Circuit Value Problem Circuit complexity Circuit satisfiability problem Decision problem Time complexity Combinational logic Algorithmic complexity Computer engineering Parallel algorithm Functional completeness Switching lemma Fan-out Hazard (logic) Inverter (logic gate) Model of computation String (computer science) Path (graph theory) Multiplexer Polylogarithmic function Polynomial hierarchy Signal propagation delay dbr:Heribert_Vollmer
has abstract	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 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Boolean_circuit
is Wikipage redirect of	Boolean circuits
is Link from a Wikipage to another Wikipage of	NC (complexity) NP/poly AC (complexity) Advice (complexity) Alexander Razborov Ancilla bit Arithmetic circuit complexity BPP (complexity) Bella Subbotovskaya Benjamin Rossman Billiard-ball computer Blichfeldt's theorem Boolean Logic gate Boolean circuits Boolean expression Boolean function Boolean hierarchy Bounded arithmetic Frege system

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 933 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software