Immunity and simplicity in relativizations of probabilistic complexity classes
The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1988 |
| 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/103554 |
| Acceso en línea: | https://hdl.handle.net/2117/103554 |
| Access Level: | acceso abierto |
| Palabra clave: | Complexity, Computational Complexity Immunity Simplicity Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
| Sumario: | The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of all possible strong separations among these relativized classes is obtained. |
|---|