About: Many-one reduction

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

Type of Turing reduction

Property	Value
dbo:description	type of Turing reduction (en)
dbo:wikiPageWikiLink	dbr:Polynomial-time_reduction dbr:Norman_Shapiro dbr:NL_(complexity) dbr:NP_(complexity) dbr:Decidability_(logic) dbc:Reduction_(complexity) dbr:Log-space_reduction dbr:PSPACE dbr:If_and_only_if dbr:Universal_Turing_machine dbr:Preorder dbr:Formal_language dbr:Halting_problem dbr:Reflexive_relation dbr:Co-NP dbr:Computability_theory dbr:L_(complexity) dbr:Algorithm dbr:Computational_complexity_theory dbr:Power_set dbr:Reduction_(complexity) dbr:Transitive_relation dbr:P_(complexity) dbr:Turing_reduction dbr:Recursively_enumerable dbr:Decision_problem dbr:Relation_(mathematics) dbr:Emil_Post dbr:Richard_Karp dbr:Iff dbr:EXP dbr:Alphabet_(computer_science) dbr:Powerset dbr:Injective dbr:Total_computable_function
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description
dct:subject	dbc:Reduction_(complexity)
gold:hypernym	dbr:Reduction
rdfs:label	Many-one reduction (en) 多対一還元 (ja) Redução por mapeamento (pt) Багатозначна зводимість (uk)
owl:sameAs	freebase:Many-one reduction wikidata:Many-one reduction dbpedia-ja:Many-one reduction dbpedia-pt:Many-one reduction dbpedia-uk:Many-one reduction dbpedia-global:Many-one reduction
prov:wasDerivedFrom	wikipedia-en:Many-one_reduction?oldid=1290497651&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Many-one_reduction
is dbo:wikiPageRedirects of	dbr:M-complete dbr:Many-one dbr:Many-one_reducible dbr:Many-to-one_reduction dbr:Mapping_reducibility dbr:Mapping_reduction
is dbo:wikiPageWikiLink of	dbr:Polynomial-time_reduction dbr:Norman_Shapiro dbr:NP-completeness dbr:Karp's_21_NP-complete_problems dbr:Creative_and_productive_sets dbr:Simple_set dbr:List_of_terms_relating_to_algorithms_and_data_structures dbr:Complement_(complexity) dbr:Decidability_(logic) dbr:Log-space_reduction dbr:Counting_problem_(complexity) dbr:NE_(complexity) dbr:SL_(complexity) dbr:Preorder dbr:Berman–Hartmanis_conjecture dbr:Arithmetical_hierarchy dbr:Post's_theorem dbr:Computability_theory dbr:PR_(complexity) dbr:Clique_problem dbr:Goishi_Hiroi dbr:NP-easy dbr:PSPACE-complete dbr:RE_(complexity) dbr:Reduction_(complexity) dbr:Turing_degree dbr:PolyL dbr:Emil_Leon_Post dbr:Turing_reduction dbr:NP-hardness dbr:Holographic_algorithm dbr:Index_set_(computability) dbr:Gadget_(computer_science) dbr:Decision_problem dbr:Computability_logic dbr:Computable_isomorphism dbr:Reduction_(computability_theory) dbr:Back-and-forth_method dbr:Polynomial-time_counting_reduction dbr:Polynomial_creativity dbr:Enumeration_reducibility dbr:Hyperarithmetical_theory dbr:Parsimonious_reduction dbr:Myhill_isomorphism_theorem dbr:M-complete dbr:Many-one dbr:Many-one_reducible dbr:Many-to-one_reduction dbr:Mapping_reducibility dbr:Mapping_reduction
is foaf:primaryTopic of	wikipedia-en:Many-one_reduction