Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/NC_(complexity)> ?p ?o }
Showing triples 1 to 73 of
73
with 100 triples per page.
- NC_(complexity) abstract "In complexity theory, the class NC (for \"Nick's Class\") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem is in NC if there exist constants c and k such that it can be solved in time O(logc n) using O(nk) parallel processors. Stephen Cook coined the name \"Nick's class\" after Nick Pippenger, who had done extensive research on circuits with polylogarithmic depth and polynomial size.Just as the class P can be thought of as the tractable problems (Cobham's thesis), so NC can be thought of as the problems that can be efficiently solved on a parallel computer. NC is a subset of P because polylogarithmic parallel computations can be simulated by polynomial-time sequential ones. It is unknown whether NC = P, but most researchers suspect this to be false, meaning that there are probably some tractable problems that are \"inherently sequential\" and cannot significantly be sped up by using parallelism. Just as the class NP-complete can be thought of as \"probably intractable\", so the class P-complete, when using NC reductions, can be thought of as \"probably not parallelizable\" or \"probably inherently sequential\".The parallel computer in the definition can be assumed to be a parallel, random-access machine (PRAM). That is a parallel computer with a central pool of memory, and any processor can access any bit of memory in constant time. The definition of NC is not affected by the choice of how the PRAM handles simultaneous access to a single bit by more than one processor. It can be CRCW, CREW, or EREW. See PRAM for descriptions of those models.Equivalently, NC can be defined as those decision problems decidable by a uniform Boolean circuit (which can be calculated from the length of the input) with polylogarithmic depth and a polynomial number of gates.RNC is a class extending NC with access to randomness.".
- NC_(complexity) wikiPageExternalLink limits.pdf.
- NC_(complexity) wikiPageID "22073".
- NC_(complexity) wikiPageLength "13697".
- NC_(complexity) wikiPageOutDegree "36".
- NC_(complexity) wikiPageRevisionID "700947718".
- NC_(complexity) wikiPageWikiLink AC_(complexity).
- NC_(complexity) wikiPageWikiLink Adder_(electronics).
- NC_(complexity) wikiPageWikiLink Alternating_Turing_machine.
- NC_(complexity) wikiPageWikiLink Big_O_notation.
- NC_(complexity) wikiPageWikiLink Boolean_circuit.
- NC_(complexity) wikiPageWikiLink Cambridge_University_Press.
- NC_(complexity) wikiPageWikiLink Carry-lookahead_adder.
- NC_(complexity) wikiPageWikiLink Category:Circuit_complexity.
- NC_(complexity) wikiPageWikiLink Category:Complexity_classes.
- NC_(complexity) wikiPageWikiLink Circuit_complexity.
- NC_(complexity) wikiPageWikiLink Cobhams_thesis.
- NC_(complexity) wikiPageWikiLink Commutator.
- NC_(complexity) wikiPageWikiLink Computational_complexity_theory.
- NC_(complexity) wikiPageWikiLink Conjugacy_class.
- NC_(complexity) wikiPageWikiLink Decision_problem.
- NC_(complexity) wikiPageWikiLink L_(complexity).
- NC_(complexity) wikiPageWikiLink Majority_function.
- NC_(complexity) wikiPageWikiLink NL_(complexity).
- NC_(complexity) wikiPageWikiLink NP-completeness.
- NC_(complexity) wikiPageWikiLink Nick_Pippenger.
- NC_(complexity) wikiPageWikiLink P-complete.
- NC_(complexity) wikiPageWikiLink P_(complexity).
- NC_(complexity) wikiPageWikiLink Parallel_computing.
- NC_(complexity) wikiPageWikiLink Parallel_random-access_machine.
- NC_(complexity) wikiPageWikiLink Polylogarithmic_function.
- NC_(complexity) wikiPageWikiLink RNC_(complexity).
- NC_(complexity) wikiPageWikiLink Solvable_group.
- NC_(complexity) wikiPageWikiLink Springer_Science+Business_Media.
- NC_(complexity) wikiPageWikiLink Stephen_Cook.
- NC_(complexity) wikiPageWikiLink Sylvester_matrix.
- NC_(complexity) wikiPageWikiLink Time_complexity.
- NC_(complexity) wikiPageWikiLinkText "'''NC'''".
- NC_(complexity) wikiPageWikiLinkText "Barrington's theorem".
- NC_(complexity) wikiPageWikiLinkText "NC (complexity)".
- NC_(complexity) wikiPageWikiLinkText "NC (complexity)#Barrington's theorem".
- NC_(complexity) wikiPageWikiLinkText "NC complexity class".
- NC_(complexity) wikiPageWikiLinkText "NC".
- NC_(complexity) wikiPageWikiLinkText "NC_(complexity)".
- NC_(complexity) wikiPageWikiLinkText "Nick's Class".
- NC_(complexity) wikiPageWikiLinkText "Nick’s Class complexity".
- NC_(complexity) wikiPageWikiLinkText "RNC".
- NC_(complexity) wikiPageWikiLinkText "difficult to parallelize".
- NC_(complexity) wikiPageUsesTemplate Template:=.
- NC_(complexity) wikiPageUsesTemplate Template:Cite_book.
- NC_(complexity) wikiPageUsesTemplate Template:ComplexityClasses.
- NC_(complexity) wikiPageUsesTemplate Template:Reflist.
- NC_(complexity) wikiPageUsesTemplate Template:Unsolved.
- NC_(complexity) subject Category:Circuit_complexity.
- NC_(complexity) subject Category:Complexity_classes.
- NC_(complexity) hypernym Set.
- NC_(complexity) type Class.
- NC_(complexity) type Redirect.
- NC_(complexity) comment "In complexity theory, the class NC (for \"Nick's Class\") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem is in NC if there exist constants c and k such that it can be solved in time O(logc n) using O(nk) parallel processors.".
- NC_(complexity) label "NC (complexity)".
- NC_(complexity) sameAs Q1141840.
- NC_(complexity) sameAs NC_(Komplexitätsklasse).
- NC_(complexity) sameAs NC_(clase_de_complejidad).
- NC_(complexity) sameAs NC_(complexité).
- NC_(complexity) sameAs NC_(complessità).
- NC_(complexity) sameAs NC_(計算複雑性理論).
- NC_(complexity) sameAs NC_(복잡도).
- NC_(complexity) sameAs NC_(complexidade).
- NC_(complexity) sameAs m.05jrf.
- NC_(complexity) sameAs NC_(độ_phức_tạp).
- NC_(complexity) sameAs Q1141840.
- NC_(complexity) wasDerivedFrom NC_(complexity)?oldid=700947718.
- NC_(complexity) isPrimaryTopicOf NC_(complexity).