DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/P_(complexity)> ?p ?o }

• P_(complexity) abstract "In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.Cobham's thesis holds that P is the class of computational problems that are \"efficiently solvable\" or \"tractable\"; in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.".
• P_(complexity) wikiPageID "658550".
• P_(complexity) wikiPageLength "12280".
• P_(complexity) wikiPageOutDegree "68".
• P_(complexity) wikiPageRevisionID "707352372".
• P_(complexity) wikiPageWikiLink Advice_(complexity).
• P_(complexity) wikiPageWikiLink Alan_Cobham_(mathematician).
• P_(complexity) wikiPageWikiLink Alternating_Turing_machine.
• P_(complexity) wikiPageWikiLink BPP_(complexity).
• P_(complexity) wikiPageWikiLink Boolean_circuit.
• P_(complexity) wikiPageWikiLink Category:Complexity_classes.
• P_(complexity) wikiPageWikiLink Charles_E._Leiserson.
• P_(complexity) wikiPageWikiLink Circuit_complexity.
• P_(complexity) wikiPageWikiLink Clifford_Stein.
• P_(complexity) wikiPageWikiLink Co-NP.
• P_(complexity) wikiPageWikiLink Cobhams_thesis.
• P_(complexity) wikiPageWikiLink Complement_(complexity).
• P_(complexity) wikiPageWikiLink Complexity_class.
• P_(complexity) wikiPageWikiLink Computational_complexity_theory.
• P_(complexity) wikiPageWikiLink Computational_resource.
• P_(complexity) wikiPageWikiLink Concatenation.
• P_(complexity) wikiPageWikiLink Constructive_proof.
• P_(complexity) wikiPageWikiLink DTIME.
• P_(complexity) wikiPageWikiLink Decision_problem.
• P_(complexity) wikiPageWikiLink Descriptive_complexity_theory.
• P_(complexity) wikiPageWikiLink Dexter_Kozen.
• P_(complexity) wikiPageWikiLink EXPTIME.
• P_(complexity) wikiPageWikiLink FO_(complexity).
• P_(complexity) wikiPageWikiLink FP_(complexity).
• P_(complexity) wikiPageWikiLink First-order_logic.
• P_(complexity) wikiPageWikiLink Forbidden_graph_characterization.
• P_(complexity) wikiPageWikiLink Function_problem.
• P_(complexity) wikiPageWikiLink Greatest_common_divisor.
• P_(complexity) wikiPageWikiLink Henry_Cabourn_Pocklington.
• P_(complexity) wikiPageWikiLink Homomorphism.
• P_(complexity) wikiPageWikiLink Intersection_(set_theory).
• P_(complexity) wikiPageWikiLink Introduction_to_Algorithms.
• P_(complexity) wikiPageWikiLink Jack_Edmonds.
• P_(complexity) wikiPageWikiLink Kleene_star.
• P_(complexity) wikiPageWikiLink L_(complexity).
• P_(complexity) wikiPageWikiLink Least_fixed_point.
• P_(complexity) wikiPageWikiLink Linear_programming.
• P_(complexity) wikiPageWikiLink Logarithm.
• P_(complexity) wikiPageWikiLink Low_(complexity).
• P_(complexity) wikiPageWikiLink Matching_(graph_theory).
• P_(complexity) wikiPageWikiLink Mitsunori_Ogihara.
• P_(complexity) wikiPageWikiLink NP_(complexity).
• P_(complexity) wikiPageWikiLink Non-deterministic_Turing_machine.
• P_(complexity) wikiPageWikiLink P-complete.
• P_(complexity) wikiPageWikiLink poly.
• P_(complexity) wikiPageWikiLink PSPACE.
• P_(complexity) wikiPageWikiLink P_versus_NP_problem.
• P_(complexity) wikiPageWikiLink Polynomial.
• P_(complexity) wikiPageWikiLink Polynomial_hierarchy.
• P_(complexity) wikiPageWikiLink Prime_number.
• P_(complexity) wikiPageWikiLink Random_access.
• P_(complexity) wikiPageWikiLink Range_concatenation_grammars.
• P_(complexity) wikiPageWikiLink Reachability.
• P_(complexity) wikiPageWikiLink Robertson–Seymour_theorem.
• P_(complexity) wikiPageWikiLink Ron_Rivest.
• P_(complexity) wikiPageWikiLink Sparse_language.
• P_(complexity) wikiPageWikiLink St-connectivity.
• P_(complexity) wikiPageWikiLink Thomas_H._Cormen.
• P_(complexity) wikiPageWikiLink Time_complexity.
• P_(complexity) wikiPageWikiLink Turing_machine.
• P_(complexity) wikiPageWikiLink Undecidable_problem.
• P_(complexity) wikiPageWikiLink Union_(set_theory).
• P_(complexity) wikiPageWikiLinkText "'''P'''".
• P_(complexity) wikiPageWikiLinkText "P (complexity)".
• P_(complexity) wikiPageWikiLinkText "P".
• P_(complexity) wikiPageWikiLinkText "P's".
• P_(complexity) wikiPageWikiLinkText "PTIME".
• P_(complexity) wikiPageWikiLinkText "PTime".
• P_(complexity) wikiPageWikiLinkText "complexity class '''P'''".
• P_(complexity) wikiPageWikiLinkText "complexity class P".
• P_(complexity) wikiPageWikiLinkText "efficient".
• P_(complexity) wikiPageWikiLinkText "polynomial time algorithm".
• P_(complexity) wikiPageWikiLinkText "polynomial time complexity".
• P_(complexity) wikiPageWikiLinkText "polynomial time".
• P_(complexity) wikiPageWikiLinkText "polynomial-time computable properties".
• P_(complexity) wikiPageWikiLinkText "polynomial-time".
• P_(complexity) wikiPageUsesTemplate Template:CZoo.
• P_(complexity) wikiPageUsesTemplate Template:Cite_book.
• P_(complexity) wikiPageUsesTemplate Template:ComplexityClasses.
• P_(complexity) wikiPageUsesTemplate Template:Reflist.
• P_(complexity) subject Category:Complexity_classes.
• P_(complexity) type Class.
• P_(complexity) type Redirect.
• P_(complexity) comment "In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes.".
• P_(complexity) label "P (complexity)".
• P_(complexity) sameAs Q846354.
• P_(complexity) sameAs كثير_حدود_(تعقيد).
• P_(complexity) sameAs P_(complexitat).
• P_(complexity) sameAs P_(třída_složitosti).
• P_(complexity) sameAs P_(Komplexitätsklasse).
• P_(complexity) sameAs P_(komplikeco).
• P_(complexity) sameAs P_(clase_de_complejidad).
• P_(complexity) sameAs کلاس_پی.
• P_(complexity) sameAs P_(vaativuusluokka).
• P_(complexity) sameAs P_(complexité).

• next