Many-one reduction: Computability theory, Computational complexity theory, Reduction (complexity), Decision problem, Turing reduction, Emil Leon Post, Norman Shapiro - Couverture souple

Couverture souple

ISBN 10 : 6133782064 ISBN 13 : 9786133782068

Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 a 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 1944. Later Norman Shapiro used the same concept in 1956 under the name strong reducibility.

Détails de l'édition

• Éditeur: Alphascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6133782064
• ISBN 13: 9786133782068
• Reliure: Broché
• Nombre de pages: 84
• Éditeur: Miller Frederic P., Vandome Agnes F., McBrewster John
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible