Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/P-complete> ?p ?o }
Showing triples 1 to 65 of
65
with 100 triples per page.
- P-complete abstract "In complexity theory, the notion of P-complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space.Formally, a decision problem is P-complete (complete for the complexity class P) if it is in P and that every problem in P can be reduced to it by using an appropriate reduction.The specific type of reduction used varies and may affect the exact set of problems. If we use NC reductions, that is, reductions which can operate in polylogarithmic time on a parallel computer with a polynomial number of processors, then all P-complete problems lie outside NC and so cannot be effectively parallelized, under the unproven assumption that NC ≠ P. If we use the weaker log-space reduction, this remains true, but additionally we learn that all P-complete problems lie outside L under the weaker unproven assumption that L ≠ P. In this latter case the set P-complete may be smaller.".
- P-complete wikiPageID "54683".
- P-complete wikiPageLength "8658".
- P-complete wikiPageOutDegree "33".
- P-complete wikiPageRevisionID "600534949".
- P-complete wikiPageWikiLink Binary_number.
- P-complete wikiPageWikiLink Binary_numeral_system.
- P-complete wikiPageWikiLink Boolean_circuit.
- P-complete wikiPageWikiLink Boolean_satisfiability_problem.
- P-complete wikiPageWikiLink Category:Complexity_classes.
- P-complete wikiPageWikiLink Class_(computer_programming).
- P-complete wikiPageWikiLink Complete_(complexity).
- P-complete wikiPageWikiLink Computational_complexity_theory.
- P-complete wikiPageWikiLink Context-free_grammar.
- P-complete wikiPageWikiLink Conways_Game_of_Life.
- P-complete wikiPageWikiLink Decision_problem.
- P-complete wikiPageWikiLink EXPTIME.
- P-complete wikiPageWikiLink EXPTIME-complete.
- P-complete wikiPageWikiLink Extended_Euclidean_algorithm.
- P-complete wikiPageWikiLink Graph_theory.
- P-complete wikiPageWikiLink Greatest_common_divisor.
- P-complete wikiPageWikiLink Gzip.
- P-complete wikiPageWikiLink Horn-satisfiability.
- P-complete wikiPageWikiLink Horn_clause.
- P-complete wikiPageWikiLink Integer_factorization.
- P-complete wikiPageWikiLink LZ77.
- P-complete wikiPageWikiLink LZ77_and_LZ78.
- P-complete wikiPageWikiLink LZW_(algorithm).
- P-complete wikiPageWikiLink L_(complexity).
- P-complete wikiPageWikiLink Lambda_calculus.
- P-complete wikiPageWikiLink Lempel–Ziv–Welch.
- P-complete wikiPageWikiLink Linear_programming.
- P-complete wikiPageWikiLink Log-space_reduction.
- P-complete wikiPageWikiLink NC_(complexity).
- P-complete wikiPageWikiLink NP-complete.
- P-complete wikiPageWikiLink NP-completeness.
- P-complete wikiPageWikiLink P_(complexity).
- P-complete wikiPageWikiLink Partial_type.
- P-complete wikiPageWikiLink Polylogarithmic_time.
- P-complete wikiPageWikiLink Sparse_language.
- P-complete wikiPageWikiLink Time_complexity.
- P-complete wikiPageWikiLink Turing_machine.
- P-complete wikiPageWikiLink Type_inference.
- P-complete wikiPageWikiLink Type_theory.
- P-complete wikiPageWikiLink Unary_numeral_system.
- P-complete wikiPageWikiLinkText "'''P'''-complete problems".
- P-complete wikiPageWikiLinkText "'''P'''-complete".
- P-complete wikiPageWikiLinkText "P-complete".
- P-complete hasPhotoCollection P-complete.
- P-complete wikiPageUsesTemplate Template:ComplexityClasses.
- P-complete subject Category:Complexity_classes.
- P-complete hypernym Pu02BC.
- P-complete type School.
- P-complete type Class.
- P-complete comment "In complexity theory, the notion of P-complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space.Formally, a decision problem is P-complete (complete for the complexity class P) if it is in P and that every problem in P can be reduced to it by using an appropriate reduction.The specific type of reduction used varies and may affect the exact set of problems.".
- P-complete label "P-complete".
- P-complete sameAs P-completo.
- P-complete sameAs P-완전.
- P-complete sameAs P-completo.
- P-complete sameAs m.0f87m.
- P-complete sameAs Q905789.
- P-complete sameAs Q905789.
- P-complete sameAs P-完全.
- P-complete wasDerivedFrom P-complete?oldid=600534949.
- P-complete isPrimaryTopicOf P-complete.