About: Complexity classes

An Entity of Type: Concept, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Property	Value
dbo:wikiPageID	694172 (xsd:integer)
dbo:wikiPageRevisionID	827976404 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Cat_main
rdf:type	skos:Concept
rdfs:label	Complexity classes (en)
skos:broader	dbc:Structural_complexity_theory dbc:Classification_systems_by_subject dbc:Computational_complexity_theory
skos:prefLabel	Complexity classes (en)
prov:wasDerivedFrom	wikipedia-en:Category:Complexity_classes?oldid=827976404&ns=14
is dbo:wikiPageWikiLink of	dbr:Pseudo-polynomial_transformation dbr:List_of_complexity_classes dbr:List_of_computability_and_complexity_topics dbr:NE_(complexity) dbr:NP_(complexity) dbr:Parity_P dbr:Strong_NP-completeness dbr:DLOGTIME dbr:DSPACE dbr:DTIME dbr:ESPACE dbr:EXPSPACE dbr:L/poly dbr:PSPACE-complete dbr:Pseudo-polynomial_time dbr:♯P dbr:♯P-complete dbr:SL_(complexity) dbr:NP-easy dbr:RE-complete dbr:W_hierarchy dbr:Co-NP dbr:NC_(complexity) dbr:NL_(complexity) dbr:LH_(complexity) dbr:LOGCFL dbr:L_(complexity) dbr:Arithmetical_hierarchy dbr:Complexity_class dbr:Fully_polynomial-time_approximation_scheme dbr:PH_(complexity) dbr:PLS_(complexity) dbr:PPA_(complexity) dbr:PPP_(complexity) dbr:PR_(complexity) dbr:P_(complexity) dbr:TC_(complexity) dbr:P/poly dbr:GI-complete dbr:GI_(complexity) dbr:GapP dbr:P-complete dbr:TFNP dbr:ELEMENTARY dbr:EXPTIME dbr:E_(complexity) dbr:PSPACE dbr:Quasi-polynomial_time dbr:RE_(complexity) dbr:R_(complexity) dbr:2-EXPTIME dbr:AC0 dbr:ACC0 dbr:AC_(complexity) dbr:ALL_(complexity) dbr:APX dbr:TC0 dbr:Co-NP-complete dbr:Co-RE dbr:Co-RE-complete dbr:CC_(complexity) dbr:Polynomial-time_approximation_scheme dbr:SC_(complexity) dbr:SNP_(complexity) dbr:UP_(complexity) dbr:Random-access_Turing_machine dbr:Exponential_hierarchy dbr:FL_(complexity) dbr:FNP_(complexity) dbr:FPT_(complexity_class) dbr:FP_(complexity) dbr:Weak_NP-completeness dbr:NEXPTIME dbr:NP-completeness dbr:NP-equivalent dbr:NP-hardness dbr:NP-intermediate dbr:NP/poly dbr:NSPACE dbr:NTIME dbr:NL-complete dbr:PolyL dbr:Nonelementary_problem dbr:SUBEXP dbr:XP_(complexity_class) dbr:PPAD_(complexity) dbr:PSPACE-hard dbr:S2P_(complexity)
is dcterms:subject of	dbr:Pseudo-polynomial_transformation dbr:List_of_complexity_classes dbr:List_of_computability_and_complexity_topics dbr:NE_(complexity) dbr:NP_(complexity) dbr:Parity_P dbr:Strong_NP-completeness dbr:DLOGTIME dbr:DSPACE dbr:DTIME dbr:ESPACE dbr:EXPSPACE dbr:L/poly dbr:PSPACE-complete dbr:Pseudo-polynomial_time dbr:♯P dbr:♯P-complete dbr:SL_(complexity) dbr:NP-easy dbr:RE-complete dbr:W_hierarchy dbr:Co-NP dbr:NC_(complexity) dbr:NL_(complexity) dbr:LH_(complexity) dbr:LOGCFL dbr:L_(complexity) dbr:Arithmetical_hierarchy dbr:Complexity_class dbr:Fully_polynomial-time_approximation_scheme dbr:PH_(complexity) dbr:PLS_(complexity) dbr:PPA_(complexity) dbr:PPP_(complexity) dbr:PR_(complexity) dbr:P_(complexity) dbr:TC_(complexity) dbr:P/poly dbr:GI-complete dbr:GI_(complexity) dbr:GapP dbr:P-complete dbr:TFNP dbr:ELEMENTARY dbr:EXPTIME dbr:E_(complexity) dbr:PSPACE dbr:Quasi-polynomial_time dbr:RE_(complexity) dbr:R_(complexity) dbr:2-EXPTIME dbr:AC0 dbr:ACC0 dbr:AC_(complexity) dbr:ALL_(complexity) dbr:APX dbr:TC0 dbr:Co-NP-complete dbr:Co-RE dbr:Co-RE-complete dbr:CC_(complexity) dbr:Polynomial-time_approximation_scheme dbr:SC_(complexity) dbr:SNP_(complexity) dbr:UP_(complexity) dbr:Random-access_Turing_machine dbr:Exponential_hierarchy dbr:FL_(complexity) dbr:FNP_(complexity) dbr:FPT_(complexity_class) dbr:FP_(complexity) dbr:Weak_NP-completeness dbr:NEXPTIME dbr:NP-completeness dbr:NP-equivalent dbr:NP-hardness dbr:NP-intermediate dbr:NP/poly dbr:NSPACE dbr:NTIME dbr:NL-complete dbr:PolyL dbr:Nonelementary_problem dbr:SUBEXP dbr:XP_(complexity_class) dbr:PPAD_(complexity) dbr:PSPACE-hard dbr:S2P_(complexity)
is skos:broader of	dbc:Probabilistic_complexity_classes
is skos:related of	dbc:Computational_resources

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

About: Complexity classes

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.