Duality Gap, Computational Complexity and NP Completeness: A Survey

Details Duality Gap, Computational Complexity and NP Completeness: A Survey Duality Gap, Computational Complexity and NP Completeness: A Survey

2010-12-27

arxiv.org/abs/1012.5568v2

Mathematics

Optimization and Control

Scientific paper

We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.

Affiliated with

Also associated with

No associations

Rating

Duality Gap, Computational Complexity and NP Completeness: A Survey does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Duality Gap, Computational Complexity and NP Completeness: A Survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Duality Gap, Computational Complexity and NP Completeness: A Survey will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-22514