Connections among non uniform models for problems requiring high amount of resources
Document typeExternal research report
Date issued1985-11
Rights accessOpen Access
Abstract
We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined by polynomial and polylog upper bounds, obtaining an unified approach to deal with upper and lower bounds. The measures are the initial index, the context-free cost, and the boolean circuits size. We interpret oir results by discussing a trade-off between oracle information and compued information for oracle Turing machines. Caracteritzem per màquines de Turing amb oracles, classes de complexitat definides per fites interiors exponencials sobre mesures no uniformes. Els mateixos mètodes ens permeten d'obtenir caracteritzacions de classes definides fer fites superiors polinòmiques i "poly-log", unificant l'estudi de fites superiors amb el de fites inferiors. Les mesures són l'índex inicial, el cost incontextual i el cost booleà. Proposem una interpretació del resultat i discutim l'equilibri entre informació calculada i informació obtinguda de l'oracle.
Description
Preliminary version
CitationBalcazar, J. L., Gabarro, J. "Connections among non uniform models for problems requiring high amount of resources". 1985.
Is part ofRR 85/16
Files | Description | Size | Format | View |
---|---|---|---|---|
OTIS_ndbibp032_0676_001.pdf | 1,710Mb | View/ |