Optimization problems and the polynomial hierarchy
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A comparison of polynomial time reducibilities
- A second step toward the polynomial hierarchy
- Complete sets and the polynomial-time hierarchy
- Computationally Related Problems
- P-Complete Approximation Problems
- Polynomial Time Enumeration Reducibility
- Reducibility among combinatorial problems
- Some simplified NP-complete graph problems
- The complexity of theorem-proving procedures
- The polynomial-time hierarchy
- Translational lemmas, polynomial time, and \((\log n)^j\)-space
Cited in
(9)- Geometric optimization and \(D^ P\)-completeness
- The difference and truth-table hierarchies for NP
- On fixed-parameter tractability and approximability of NP optimization problems
- Geometric optimization and the polynomial hierarchy
- On the Stackelberg knapsack game
- The complexity of facets (and some facets of complexity)
- On a three-level competitive pricing problem with uniform and mill pricing strategies
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
- On the complexity of test case generation for NP-hard problems
This page was built for publication: Optimization problems and the polynomial hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152218)
