Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Many-one_reduction> ?p ?o }
Showing triples 1 to 79 of
79
with 100 triples per page.
- Many-one_reduction abstract "In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem into instances of a second decision problem. Reductions are thus used to measure the relative computational difficulty of two problems.Many-one reductions are a special case and stronger form of Turing reductions. With many-one reductions the oracle can be invoked only once at the end and the answer cannot be modified.Many-one reductions were first used by Emil Post in a paper published in 1944. Later Norman Shapiro used the same concept in 1956 under the name strong reducibility.".
- Many-one_reduction wikiPageID "362983".
- Many-one_reduction wikiPageLength "5675".
- Many-one_reduction wikiPageOutDegree "40".
- Many-one_reduction wikiPageRevisionID "680675098".
- Many-one_reduction wikiPageWikiLink Algorithm.
- Many-one_reduction wikiPageWikiLink Alphabet_(computer_science).
- Many-one_reduction wikiPageWikiLink Alphabet_(formal_languages).
- Many-one_reduction wikiPageWikiLink Binary_relation.
- Many-one_reduction wikiPageWikiLink Bulletin_of_the_American_Mathematical_Society.
- Many-one_reduction wikiPageWikiLink Category:Computability_theory.
- Many-one_reduction wikiPageWikiLink Category:Computational_complexity_theory.
- Many-one_reduction wikiPageWikiLink Co-NP.
- Many-one_reduction wikiPageWikiLink Computability_theory.
- Many-one_reduction wikiPageWikiLink Computable_function.
- Many-one_reduction wikiPageWikiLink Computational_complexity_theory.
- Many-one_reduction wikiPageWikiLink Decidability_(logic).
- Many-one_reduction wikiPageWikiLink Decision_problem.
- Many-one_reduction wikiPageWikiLink EXP.
- Many-one_reduction wikiPageWikiLink EXPTIME.
- Many-one_reduction wikiPageWikiLink Emil_Leon_Post.
- Many-one_reduction wikiPageWikiLink Emil_Post.
- Many-one_reduction wikiPageWikiLink Formal_language.
- Many-one_reduction wikiPageWikiLink Halting_problem.
- Many-one_reduction wikiPageWikiLink If_and_only_if.
- Many-one_reduction wikiPageWikiLink Iff.
- Many-one_reduction wikiPageWikiLink Injective.
- Many-one_reduction wikiPageWikiLink Injective_function.
- Many-one_reduction wikiPageWikiLink L_(complexity).
- Many-one_reduction wikiPageWikiLink Log-space_reduction.
- Many-one_reduction wikiPageWikiLink NL_(complexity).
- Many-one_reduction wikiPageWikiLink NP_(complexity).
- Many-one_reduction wikiPageWikiLink Norman_Shapiro.
- Many-one_reduction wikiPageWikiLink PSPACE.
- Many-one_reduction wikiPageWikiLink P_(complexity).
- Many-one_reduction wikiPageWikiLink Polynomial-time_reduction.
- Many-one_reduction wikiPageWikiLink Power_set.
- Many-one_reduction wikiPageWikiLink Powerset.
- Many-one_reduction wikiPageWikiLink Preorder.
- Many-one_reduction wikiPageWikiLink Recursively_enumerable.
- Many-one_reduction wikiPageWikiLink Recursively_enumerable_set.
- Many-one_reduction wikiPageWikiLink Reduction_(complexity).
- Many-one_reduction wikiPageWikiLink Reflexive_relation.
- Many-one_reduction wikiPageWikiLink Relation_(mathematics).
- Many-one_reduction wikiPageWikiLink Total_computable_function.
- Many-one_reduction wikiPageWikiLink Transactions_of_the_American_Mathematical_Society.
- Many-one_reduction wikiPageWikiLink Transitive_relation.
- Many-one_reduction wikiPageWikiLink Turing_reduction.
- Many-one_reduction wikiPageWikiLink Universal_Turing_machine.
- Many-one_reduction wikiPageWikiLinkText "1-complete".
- Many-one_reduction wikiPageWikiLinkText "1-reducible".
- Many-one_reduction wikiPageWikiLinkText "Many-one reducibility".
- Many-one_reduction wikiPageWikiLinkText "Many-one reduction".
- Many-one_reduction wikiPageWikiLinkText "Many-one".
- Many-one_reduction wikiPageWikiLinkText "One-one reducibility".
- Many-one_reduction wikiPageWikiLinkText "m-reducible".
- Many-one_reduction wikiPageWikiLinkText "many-one complete".
- Many-one_reduction wikiPageWikiLinkText "many-one equivalent".
- Many-one_reduction wikiPageWikiLinkText "many-one reducibility".
- Many-one_reduction wikiPageWikiLinkText "many-one reducible".
- Many-one_reduction wikiPageWikiLinkText "many-one reduction".
- Many-one_reduction wikiPageWikiLinkText "one-one reducible".
- Many-one_reduction wikiPageWikiLinkText "reducible".
- Many-one_reduction hasPhotoCollection Many-one_reduction.
- Many-one_reduction wikiPageUsesTemplate Template:Reflist.
- Many-one_reduction subject Category:Computability_theory.
- Many-one_reduction subject Category:Computational_complexity_theory.
- Many-one_reduction hypernym Reduction.
- Many-one_reduction type Organisation.
- Many-one_reduction comment "In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem into instances of a second decision problem. Reductions are thus used to measure the relative computational difficulty of two problems.Many-one reductions are a special case and stronger form of Turing reductions.".
- Many-one_reduction label "Many-one reduction".
- Many-one_reduction sameAs 多対一還元.
- Many-one_reduction sameAs Redução_por_mapeamento.
- Many-one_reduction sameAs m.01_ngp.
- Many-one_reduction sameAs Багатозначна_зводимість.
- Many-one_reduction sameAs Q3300648.
- Many-one_reduction sameAs Q3300648.
- Many-one_reduction wasDerivedFrom Many-one_reduction?oldid=680675098.
- Many-one_reduction isPrimaryTopicOf Many-one_reduction.