Matches in DBpedia 2014 for { <http://dbpedia.org/resource/CC_(complexity)> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- CC_(complexity) abstract "In computational complexity theory, CC (Comparator Circuits) is the complexity class containing decision problems which can be solved by comparator circuits of polynomial size. Comparator circuits are sorting networks in which each comparator gate is directed, each wire is initialized with an input variable, its negation, or a constant, and one of the wires is distinguished as the output wire.The most important problem which is complete for CC is a decision variant of the stable marriage problem.".
- CC_(complexity) thumbnail Comparator_gate_in_a_comparator_circuit.png?width=300.
- CC_(complexity) wikiPageID "37764147".
- CC_(complexity) wikiPageRevisionID "550130284".
- CC_(complexity) hasPhotoCollection CC_(complexity).
- CC_(complexity) subject Category:Circuit_complexity.
- CC_(complexity) subject Category:Complexity_classes.
- CC_(complexity) comment "In computational complexity theory, CC (Comparator Circuits) is the complexity class containing decision problems which can be solved by comparator circuits of polynomial size.".
- CC_(complexity) label "CC (complexity)".
- CC_(complexity) sameAs m.0nhj6_8.
- CC_(complexity) sameAs Q5009755.
- CC_(complexity) sameAs Q5009755.
- CC_(complexity) wasDerivedFrom CC_(complexity)?oldid=550130284.
- CC_(complexity) depiction Comparator_gate_in_a_comparator_circuit.png.
- CC_(complexity) isPrimaryTopicOf CC_(complexity).
