A positive relativization of polynomial time vs. polylog space
Can every set in P be solved in polylogarithmic space? We show that this question is equivalent to asking whether the classes PSPACE and EXPTIME are always equal under relativization. We use an oracle access mechanism that is fair, in the sense that it maintains all known relationships between unrel...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1991 |
| 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/328495 |
| Acceso en línea: | https://hdl.handle.net/2117/328495 |
| Access Level: | acceso abierto |
| Palabra clave: | Computational complexity Complexitat computacional Àrees temàtiques de la UPC::Informàtica |
| Sumario: | Can every set in P be solved in polylogarithmic space? We show that this question is equivalent to asking whether the classes PSPACE and EXPTIME are always equal under relativization. We use an oracle access mechanism that is fair, in the sense that it maintains all known relationships between unrelativized PSPACE and EXPTIME. |
|---|