Show simple item record

dc.contributor.authorJenner Núñez, Birgit
dc.contributor.authorTorán Romero, Jacobo
dc.date.accessioned2016-11-18T11:36:18Z
dc.date.available2016-11-18T11:36:18Z
dc.date.issued1993-03
dc.identifier.citationJenner, B., Toran, J. "Computing functions with parallel queries to NP". 1993.
dc.identifier.urihttp://hdl.handle.net/2117/96815
dc.description.abstractThe class "Theta_2^p" of languages polynomial time truth-table reducible to sets in NP has a wide range of different characterizations. We survey some of them studying the classes obtained when the characterizations are used to define functions instead of languages. We show that in this way the three function classes FP_parallel^NP, FP_log^NP and FL_log^NP are obtained. We give an overview about the known relationships between these classes, including some original results.
dc.format.extent15 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherTheta_2^p class of languages
dc.subject.otherPolynomial time truth-table reduction
dc.subject.otherParallel queries to NP
dc.titleComputing functions with parallel queries to NP
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1835540
dc.description.versionPostprint (published version)
local.citation.authorJenner, B.; Toran, J.


Files in this item

Thumbnail

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