Advertisement

Journal of Computer Science and Technology

, Volume 11, Issue 2, pp 126–132 | Cite as

Some undecidable problems on approximability of NP optimization problems

  • Huang Xiong 
Article
  • 28 Downloads

Abstract

In this paper some undecidable problems on approximability of NP optimization problems are investigated. In particular, the following problems are all undecidable: (1) Given an NP optimization problem, is it approximable in polynomial time? (2) For any polynomial-time computable functionr(n), given a polynomial time approximable NP optimization problem, has it a polynomial-time approximation algorithm with approximation performance ratior(n) (r(n)-approximable)? (3) For any polynomial-time computable functionsr(n), r'(n), wherer'(n) <r(n) a.e., given anr(n)-approximable NP optimization problem, is itr'(n)-approximable?

Keywords

Computational complexity NP optimization approximability undecidability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Garey M R, Johnson D S. “Strong” NP-complete results: Motivation, examples, and implications.JACM, 1978, 25: 499–508.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Hopcroft J E, Ullman J D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979.Google Scholar
  3. [3]
    Kolaitis P G, Thakur M N. Approximation properties of NP minimization classes. InProc. 6th Annual Conf. on Structure in Complexity Theory, 1991, pp.353–366.Google Scholar
  4. [4]
    Papadimitriou C H, Yannakakis M. Optimization, approximation, and complexity classes.Journal of Computer and System Science, 1991, 43: 425–440.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Paz A, Moran S. Non-deterministic polynomial optimization problems and their approximation.Theoretical Computer Science, 1981, 15: 251–277.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1996

Authors and Affiliations

  • Huang Xiong 
    • 1
  1. 1.Department of Computer Science and TechnologyPeking UniversityBeijing

Personalised recommendations