Uniform characterizations of non-uniform complexity measures
The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define a dual class and state some of its properties.
| Authors: | , , |
|---|---|
| Format: | report |
| Publication Date: | 1985 |
| 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/110675 |
| Online Access: | https://hdl.handle.net/2117/110675 |
| Access Level: | Open access |
| Keyword: | Complexity, Computational Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
| Summary: | The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define a dual class and state some of its properties. |
|---|