Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1313-0876-5 |
Объём: | 116 страниц |
Масса: | 196 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles! In computability theory and computational complexity theory, a reduction is a transformation of one problem 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.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.