Show simple item record

dc.contributor.authorBalcázar Navarro, José Luis
dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.otherFacultat d'Informàtica de Barcelona
dc.identifier.citationBalcazar, J. L., Diaz, J., Gabarro, J. "Uniform characterizations of non-uniform complexity measures". 1985.
dc.description.abstractThe 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.
dc.format.extent32 p.
dc.relation.ispartofseriesRR 85/18
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshComplexity, Computational
dc.titleUniform characterizations of non-uniform complexity measures
dc.typeExternal research report
dc.subject.lemacComplexitat computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorBalcazar, J. L.; Diaz, J.; Gabarro, J.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder