Simplicity, relativizations, and nondeterminism
Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle is constructed relative to which a simple set exists for NP. Some other general theorems are proven, showing that the time bounds are not a crucial hypothesis; bounds on the way in which the oracle is...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1985 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/102119 |
| Acceso en línea: | https://hdl.handle.net/2117/102119 https://dx.doi.org/10.1137/0214012 |
| Access Level: | acceso abierto |
| Palabra clave: | Complexity, Computational Simplicity Relativizations Nondeterminism Complexity classes Simple sets Recursive oracle NP Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
| Sumario: | Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle is constructed relative to which a simple set exists for NP. Some other general theorems are proven, showing that the time bounds are not a crucial hypothesis; bounds on the way in which the oracle is accessible, namely the number of queries and/or the number of nondeterministic steps, are shown to be the fundamental hypothesis. As a result, simple sets are shown to exist in many different relativized complexity classes |
|---|