Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In Computational complexity theory, an advice string is an extra input to a Turing machine which is allowed to depend on the length n of the input, but not on input itself. A decision problem is in the complexity class P/f(n) if there is a polynomial time Turing machine M with the following property: for any n, there is an advice string A of length f(n) such that, for any input x of length n, the machine M correctly decides the problem on the input x, given x and A.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.