Advice (complexity)
id:
advice-complexity-192-14651415
title:
Advice (complexity)
text:
In computational complexity theory, an advice string is an extra input to a Turing machine that is allowed to depend on the length n of the input, but not on the 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. The most common complexity
brand slug:
wiki
category slug:
encyclopedia
description:
Computational input that relies on the length but not content of the input
original url:
https://en.wikipedia.org/wiki/Advice_(complexity)
date created:
date modified:
2023-08-04T05:39:38Z
main entity:
{"identifier":"Q4686786","url":"https://www.wikidata.org/entity/Q4686786"}
image:
fields total:
13
integrity:
14