Geometric optimization and D^ P-completeness
The task of classifying the complexity of optimization problems accurately in the polynomial hierarchy is one of continuing interest and importance. We show that a large number of geometric optimization problems, that arise naturally from the optimal placement of simple geometric objects are complete for a class \(D^ P\). The class of \(D^ p\) is defined as follows: L is in \(D^ p\) iff L is an intersection of \(L_ 1\) and \(L_ 2\) such that \(L_ 1\) is in NP and \(L_ 2\) is in Co- NP. The class \(D^ p\) contains both NP and Co-NP and is contained in \(\Delta_ 2^ P=P^{NP}\). Completeness in \(D^ p\) is exhibited under many-one and positive reductions. These results also prove the existence of natural geometric optimization problems that are proper in \(\Delta^ P_ 2=P^{NP}\). Further OptP(O(log n)) results are exhibited for some of these optimization problems.
- A comparison of polynomial time reducibilities
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3296475 (Why is no real title available?)
- On the Complexity of Some Common Geometric Location Problems
- On the complexity of unique solutions
- Optimal packing and covering in the plane are NP-complete
- Optimization problems and the polynomial hierarchy
- Second Order Sufficiency Criteria for a Discrete Optimal Control Problem
- Second-order analysis of polyhedral systems in finite and infinite dimensions with applications to robust stability of variational inequalities
- The algebraic degree of geometric optimization problems
- The complexity of facets (and some facets of complexity)
- The complexity of facets (and some facets of complexity)
- The algebraic degree of geometric optimization problems
- Geometry of optimal value functions with applications to redundancy in linear programming
- Complexity of convex optimization using geometry-based measures and a reference point
- Some easy and some not so easy geometric optimization problems
- Geometric minimization under external equivalence for implicit descriptions
- scientific article; zbMATH DE number 3965441 (Why is no real title available?)
- P-COMPLETE GEOMETRIC PROBLEMS
- scientific article; zbMATH DE number 809154 (Why is no real title available?)
- Optimality criteria for general unconstrained geometric programming problems
This page was built for publication: Geometric optimization and \(D^ P\)-completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106665)