This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n7http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Circuit_(computer_science)
rdf:type
dbo:Person
rdfs:label
Circuit (computer science)
rdfs:comment
In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function. Circuits of this kind provide a generalization of Boolean circuits and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain and the values the gates can produce. For example, the values in a Boolean circuit are boolean values, and the circuit includes conjunction, disjunction, and negation gates. The values in an integer circuit are sets of integers and the gates compute set union, set intersection, and set complement, as well as the arithmetic operations addition and multiplication.
owl:sameAs
freebase:m.0ch30by
dbp:wikiPageUsesTemplate
dbt:Cite_journal dbt:Cite_book
dct:subject
dbc:Theory_of_computation dbc:Circuit_complexity
gold:hypernym
dbr:Model
prov:wasDerivedFrom
n7:Circuit_(computer_science)?oldid=1068234444&ns=0
dbo:wikiPageID
27753031
dbo:wikiPageLength
5208
dbo:wikiPageRevisionID
1068234444
dbo:wikiPageWikiLink
dbr:Integer_circuit dbr:Multiplication dbc:Theory_of_computation dbr:Intersection_(set_theory) dbr:Boolean_circuit dbr:Boolean_data_type dbr:Subroutine dbr:Circuits_over_sets_of_natural_numbers dbr:Addition dbr:Logical_conjunction dbr:NC_(complexity) dbr:Complexity_class dbr:Negation dbr:Set_(mathematics) dbr:Logic_gate dbr:Model_of_computation dbr:Theoretical_computer_science dbr:Boolean_function dbr:Circuit_complexity dbr:Directed_acyclic_graph dbr:Longest_path_problem dbr:Union_(set_theory) dbr:Logical_disjunction dbr:Quantum_circuit dbr:Complement_(set_theory) dbr:Directed_graph dbr:Integer dbr:Arithmetic dbr:Graph_labeling dbr:P-complete dbr:Recursive_language dbr:BQP dbc:Circuit_complexity dbr:AC_(complexity) dbr:TC_(complexity)
dbo:abstract
In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function. Circuits of this kind provide a generalization of Boolean circuits and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain and the values the gates can produce. For example, the values in a Boolean circuit are boolean values, and the circuit includes conjunction, disjunction, and negation gates. The values in an integer circuit are sets of integers and the gates compute set union, set intersection, and set complement, as well as the arithmetic operations addition and multiplication.
foaf:isPrimaryTopicOf
n7:Circuit_(computer_science)