Show simple item record

dc.contributor.authorTorán Romero, Jacobo
dc.contributor.authorKöbler, Johannes
dc.identifier.citationKöbler, J.; Schöning, U.; Torán, J. "Turing machines with few accepting computations". 1988.
dc.description.abstractIn this paper we study complexity classes defined by path-restricted nondeterministic machines. We prove that for every language L in the class Few a polynomial time nondeterministic machine can be constructed which has f(x)+1 accepting paths for strings x ¿ L, and f(x) accepting paths for strings that are not in L, being f a function in PF. From this result we obtain lowness properties of the class Few, and positive relativizations of different counting classes.
dc.format.extent15 p.
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshTuring machines
dc.subject.otherTuring machines
dc.titleTuring machines with few accepting computations
dc.typeExternal research report
dc.subject.lemacTuring, Màquines de
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorKöbler, J.; Schöning, U.; Torán, J.
dc.audience.aaaSchöning, Uwe

Files in this item


This item appears in the following Collection(s)

    Show simple item record

    Attribution-NonCommercial-NoDerivs 3.0 Spain
    Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain