About: P/poly

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

Complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function

Property	Value
dbo:description	Komplexitätsklasse (de) clase de complejidad (es) classe di complessità (it) classe de problèmes de décision en informatique (fr) complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function (en)
dbo:wikiPageWikiLink	dbr:NEXPTIME dbr:Chernoff_bound dbr:NP_(complexity) dbr:PSPACE dbr:Polynomial_hierarchy dbr:EXPTIME dbr:Cryptography dbr:Formal_language dbr:Circuit_complexity dbr:RP_(complexity) dbr:Computational_complexity_theory dbr:Bounded-error_probabilistic_polynomial dbr:Complexity_class dbr:Karp–Lipton_theorem dbr:Sparse_language dbr:Unary_language dbr:P_(complexity) dbr:Undecidable_problem dbr:Padding_argument dbr:Leonard_Adleman dbr:Rainbow_table dbr:Advice_(complexity) dbr:IP_(complexity) dbr:L/poly dbr:Turing_machine dbc:Complexity_classes dbr:Miller–Rabin_primality_test dbr:Decision_problem dbr:Arthur–Merlin_protocol dbr:BPL_(complexity) dbr:NP/poly dbr:Charles_H._Bennett_(computer_scientist) dbr:Sharp_P dbr:Union_bound dbr:Permanent_is_sharp-P-complete dbr:Polynomial-time_Turing_reduction
dbp:wikiPageUsesTemplate	dbt:Prime dbt:Reflist dbt:ComplexityClasses dbt:Mvar dbt:Short_description
dct:subject	dbc:Complexity_classes
gold:hypernym	dbr:Class
rdfs:label	P/poly (en) P/poly (de) P/poly (es) P/poly (fr) P/polinomial (pt)
owl:sameAs	freebase:P/poly yago-res:P/poly wikidata:P/poly dbpedia-de:P/poly dbpedia-fr:P/poly dbpedia-pt:P/poly dbpedia-he:P/poly dbpedia-es:P/poly dbpedia-global:P/poly
prov:wasDerivedFrom	wikipedia-en:P/poly?oldid=1279748719&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:P/poly
is dbo:wikiPageRedirects of	dbr:PSIZE dbr:Adleman's_theorem dbr:Adleman_Theorem dbr:Adleman_theorem dbr:P\Poly
is dbo:wikiPageWikiLink of	dbr:BPP_(complexity) dbr:Next-bit_test dbr:Yao's_test dbr:Berman–Hartmanis_conjecture dbr:Exponential_time_hypothesis dbr:Binary_decision_diagram dbr:Boolean_circuit dbr:Circuit_complexity dbr:Proof_complexity dbr:Aarhus_University_Department_of_Computer_Science dbr:Boolean_satisfiability_problem dbr:Complexity_class dbr:List_of_complexity_classes dbr:Karp–Lipton_theorem dbr:Sparse_language dbr:Unary_language dbr:P_(complexity) dbr:Advice_(complexity) dbr:L/poly dbr:AC0 dbr:Natural_proof dbr:Arthur–Merlin_protocol dbr:S2P_(complexity) dbr:NP/poly dbr:PSIZE dbr:Adleman's_theorem dbr:Adleman_Theorem dbr:Adleman_theorem dbr:P\Poly
is foaf:primaryTopic of	wikipedia-en:P/poly