Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Circuit complexity
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Model of computational complexity
Property
Value
dbo:
description
model of computational complexity
(en)
egy algoritmus hardveres implementálásához szükséges áramkör (Boole-áramkör) bonyolultsága
(hu)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Three_input_boolean_circuit.svg?width=300
dbo:
wikiPageExternalLink
http://www.cs.tau.ac.il/~zwick/scribe-boolean.html
http://eccc.hpi-web.de/static/books/The_Complexity_of_Boolean_Functions/
dbo:
wikiPageWikiLink
dbr
:Abstract_machine
dbr
:PP_(complexity)
dbr
:NC_(complexity)
dbr
:File:Three_input_Boolean_circuit.jpg
dbr
:Parity_function
dbr
:Ran_Raz
dbr
:Turing_machine_equivalents
dbr
:NP_(complexity)
dbr
:Recursive_language
dbc
:Computational_complexity_theory
dbr
:Formal_language
dbr
:Boolean_circuit
dbr
:Clique_problem
dbr
:Directed_acyclic_graph
dbr
:Bit
dbr
:AND_gate
dbr
:OR_gate
dbr
:Theoretical_computer_science
dbr
:Electronic_Colloquium_on_Computational_Complexity
dbr
:Alexander_Razborov
dbr
:Claude_Shannon
dbr
:Johan_Håstad
dbr
:Computational_complexity_theory
dbr
:Complexity_class
dbr
:DLOGTIME
dbr
:P_(complexity)
dbr
:Average-case_complexity
dbr
:TC0
dbr
:P/poly
dbr
:AC_(complexity)
dbr
:Computational_resource
dbr
:Computational_problem
dbr
:Turing_machine
dbr
:AC0
dbc
:Circuit_complexity
dbr
:Derandomization
dbr
:Boolean_function
dbr
:ACC0
dbr
:Natural_proof
dbr
:MA_(complexity)
dbr
:Ryan_Williams_(computer_scientist)
dbr
:S2P_(complexity)
dbr
:B._G._Teubner_Verlag
dbr
:NOT_gate
dbr
:Springer_Verlag
dbr
:NC1_(complexity)
dbr
:Machine_that_always_halts
dbr
:Pierre_McKenzie
dbr
:John_Wiley_&_Sons_Ltd.
dbr
:Circuit_minimization
dbr
:Deterministic_Turing_machine
dbr
:In-degree
dbp:
b
2
(xsd:integer)
dbp:
cs1Dates
y
(en)
dbp:
date
May 2019
(en)
dbp:
group
"nb"
(en)
dbp:
p
P
(en)
dbp:
wikiPageUsesTemplate
dbt
:Cite_book
dbt
:Cite_web
dbt
:Reflist
dbt
:Su
dbt
:Use_dmy_dates
dbt
:Unreferenced_section
dbt
:Short_description
dct:
subject
dbc
:Computational_complexity_theory
dbc
:Circuit_complexity
rdfs:
label
Circuit complexity
(en)
Complexitat de circuits
(ca)
Complessità dei circuiti
(it)
回路計算量
(ja)
Complexidade de circuitos
(pt)
电路复杂性
(zh)
owl:
sameAs
freebase
:Circuit complexity
wikidata
:Circuit complexity
dbpedia-it
:Circuit complexity
dbpedia-zh
:Circuit complexity
dbpedia-ja
:Circuit complexity
dbpedia-pt
:Circuit complexity
dbpedia-ca
:Circuit complexity
dbpedia-global
:Circuit complexity
dbr
:Circuit complexity
prov:
wasDerivedFrom
wikipedia-en
:Circuit_complexity?oldid=1290933225&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Three_input_boolean_circuit.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Circuit_complexity
is
dbo:
wikiPageDisambiguates
of
dbr
:Circuit
is
dbo:
wikiPageRedirects
of
dbr
:Monotone_circuit
dbr
:Uniformity_(complexity)
dbr
:P-nonuniform
dbr
:Circuit-depth_complexity
dbr
:Circuit-size_complexity
dbr
:Circuit_class
dbr
:Circuit_lower_bounds
dbr
:Uniform_circuit_complexity
dbr
:Uniform_circuit_family
dbr
:Uniformity_(circuit)
dbr
:Logspace_uniform
dbr
:Polynomial-time_uniform
is
dbo:
wikiPageWikiLink
of
dbr
:List_of_computability_and_complexity_topics
dbr
:Tardos_function
dbr
:NL_(complexity)
dbr
:Majority_function
dbr
:Blue_book
dbr
:Parity_function
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Turing_machine_equivalents
dbr
:Ingo_Wegener
dbr
:Adder_(electronics)
dbr
:András_Hajnal
dbr
:Quantum_circuit
dbr
:Fusion_tree
dbr
:Gödel_Prize
dbr
:Descriptive_complexity_theory
dbr
:Boolean_circuit
dbr
:Clique_problem
dbr
:Proof_complexity
dbr
:Theoretical_computer_science
dbr
:Alexander_Razborov
dbr
:Avi_Wigderson
dbr
:Johan_Håstad
dbr
:Michael_Sipser
dbr
:Sunflower_(mathematics)
dbr
:Computational_complexity_theory
dbr
:TC_(complexity)
dbr
:DLOGTIME
dbr
:Karp–Lipton_theorem
dbr
:Pseudorandom_generator
dbr
:BQP
dbr
:Circuit
dbr
:P_(complexity)
dbr
:Averaging_argument
dbr
:TC0
dbr
:P/poly
dbr
:Boolean_algebra
dbr
:Logic_optimization
dbr
:AC_(complexity)
dbr
:Advice_(complexity)
dbr
:L/poly
dbr
:AC0
dbr
:Boolean_function
dbr
:Circuit_(computer_science)
dbr
:Circuits_over_sets_of_natural_numbers
dbr
:Lupanov_representation
dbr
:ACC0
dbr
:Natural_proof
dbr
:Switching_circuit_theory
dbr
:Asymptotic_computational_complexity
dbr
:Descriptional_Complexity_of_Formal_Systems
dbr
:Lovász_number
dbr
:Semi-membership
dbr
:NP/poly
dbr
:James_B._Saxe
dbr
:Descriptive_Complexity
dbr
:Monotone_circuit
dbr
:Uniformity_(complexity)
dbr
:P-nonuniform
dbr
:Circuit-depth_complexity
dbr
:Circuit-size_complexity
dbr
:Circuit_class
dbr
:Circuit_lower_bounds
dbr
:Uniform_circuit_complexity
dbr
:Uniform_circuit_family
dbr
:Uniformity_(circuit)
dbr
:Logspace_uniform
dbr
:Polynomial-time_uniform
is
rdfs:
seeAlso
of
dbr
:Boolean_circuit
is
foaf:
primaryTopic
of
wikipedia-en
:Circuit_complexity
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International