Continuous optimization problems and a polynomial hierarchy of real functions
Author:
- 1 December 1985
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 1 (2) , 210-231
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On some natural complete operatorsTheoretical Computer Science, 1985
- The computational complexity of maximization and integrationAdvances in Mathematics, 1984
- On self-reducibility and weak P-selectivityJournal of Computer and System Sciences, 1983
- Computational complexity of real functionsTheoretical Computer Science, 1982
- The maximum value problem and NP real numbersJournal of Computer and System Sciences, 1982
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On the Definition of Computable Function of a Real VariableMathematical Logic Quarterly, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974