Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Acta Informatica
Generalizations of Opt P to the polynomial hierarchy
Theoretical Computer Science
Gap-definable counting classes
Journal of Computer and System Sciences
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
SIAM Journal on Computing
The complexity theory companion
The complexity theory companion
A Foundation of Programming a Multi-tape Quantum Turing Machine
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Analysis of Quantum Functions (Preliminary Version)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the Counting Functions
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
Krentel [J. Comput. System. Sci., 36, pp.490-509] presented a framework for combinatorial NP optimization problems that search optimal values of polynomial-size solutions computed deterministically in polynomial time. This paper applies his framework to a quantum expansion of such optimization problems. With the notion of an "universal" quantum function similar to a classical "complete" function, we exhibit canonical quantum optimization problems whose optimal cost functions are universal for certain classes of quantum optimization problems. We also study the complexity of quantum optimization problems in connection to well-known complexity classes.