Logarithmic advice classes
Karp and Lipton [9] introduced the notion of non-uniform complexity classes where a certain amount of "side information", the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton (and also later researchers [22,17,2,12]) concentrated on the study o...
| Authors: | , |
|---|---|
| Format: | report |
| Publication Date: | 1988 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/189554 |
| Online Access: | https://hdl.handle.net/2117/189554 |
| Access Level: | Open access |
| Keyword: | Algorithms Karp and Lipton Logaritmes Algorismes Àrees temàtiques de la UPC::Informàtica |
| Summary: | Karp and Lipton [9] introduced the notion of non-uniform complexity classes where a certain amount of "side information", the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton (and also later researchers [22,17,2,12]) concentrated on the study of classes of the form C/poly where C is P, NP, or PSPACE, and poly denotes a polynomial size advice. This paper starts a study of classes of the form C/log. As a main result it is shown that in the context of an NP/log computation a log-bounded advice is equivalent to a sparse oracle in NP. In contrast, it has been shown that a poly-bounded advice corresponds to an arbitrary sparse oracle set. Furthermore, a general theorem is presented that generalizes Karp and Lipton's "round-robin tournament" method. |
|---|