##
###
Continuous optimization problems and a polynomial hierarchy of real functions

Ker-I Ko

1985
*
Journal of Complexity
*

*A* natural extension *of* NP-time *computable* *real* *functions* *to* *a* polynomial hierarchy *of* *real* *functions* has *a* characterization by alternating *operations* *of* maximization and minimization. ...
We examine this relationship on *real* *functions* and give *a* characterization *of* NP-time *computable* *real* *functions* by the maximization *operation*. ...
It is natural *to* define Z g,c[,,, ,I, k 2 1, *to* be the *class* *of* *real* *functions* f on [0, l] that is *computable* by *a* polynomial-time two-oracle NTM M *with* *respect* *to* an oracle B E Xc--,, in the sense that ...

doi:10.1016/0885-064x(85)90012-3
fatcat:4zmztiudhnhvzf7inahednsdfa