9786131308765 - reduction (complexity): computability theory, computational complexity theory, computational problem, complexity class (4 Ergebnisse)
- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 39,00
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 reduction is a transformation of one proble…m into another problem. Depending on the transformation used this can be used to define complexity classes on a set of problems. Intuitively, problem A is reducible to problem B if solutions to B exist and give solutions to A whenever A has solutions. Thus, solving A cannot be harder than solving B. We write A B, usually with a subscript on the to indicate the type of reduction being used. 116 pp. Englisch.
- Softcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 40,58
EUR 60,96 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 reduction is a transformation of one problem int…o another problem. Depending on the transformation used this can be used to define complexity classes on a set of problems. Intuitively, problem A is reducible to problem B if solutions to B exist and give solutions to A whenever A has solutions. Thus, solving A cannot be harder than solving B. We write A B, usually with a subscript on the to indicate the type of reduction being used.
- Softcover
- Print-on-Demand
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 125,30
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Reduction (Complexity) | Computability Theory, Computational Complexity Theory, Computational Problem, Complexity Class | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131308765 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 490…78 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 156,00
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computabilitytheory and computational complexity theory, a reduction is atransformation of one problem into…another problem. Depending on thetransformation used this can be used to define complexity classes on aset of problems. Intuitively, problem A is reducible to problem B ifsolutions to B exist and give solutions to A whenever A has solutions.Thus, solving A cannot be harder than solving B. We write A ¿ B, usuallywith a subscript on the ¿ to indicate the type of reduction being used.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 116 pp. Englisch.
