Witness-isomorphic reductions and the local search problem (extended abstract)

  • Sophie Fischer
  • Lane Hemaspaandra
  • Leen Torenvliet
Contributed Papers Graphs in Models of Computations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


We study witness-isomorphic reductions, a type of structure-preserving reduction between NP-decision problems. We show that witness-isomorphic reductions can be used in a uniform approach to the local search problem.


Local Search Vertex Cover Boolean Formula Satisfying Assignment Tight Connection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AB92]
    M. Agrawal and S. Biswas. Universal relations. In Proceedings of the 1th Structure in Complexity Theory Conference, pages 207–220, Boston, Mass., June 1992. IEEE Computer Society Press.Google Scholar
  2. [ADP80]
    G. Ausiello, A. D'Atri, and M. Protasi. Structure preserving reductions among convex optimization problems. J. Computer and System Sciences, 21:136–153, 1980.Google Scholar
  3. [BH77]
    L. Berman and H. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comput., 6:305–322, 1977.CrossRefGoogle Scholar
  4. [EW]
    K. Edwards and D. Welsh. On the complexity of uniqueness problems. Manuscript, early 1980s.Google Scholar
  5. [Fis95]
    S. Fischer. On the complexity of local search problems. Information Processing Letters, 53:69–75, 1995.Google Scholar
  6. [HH91]
    J. Hartmanis and L. Hemachandra. One-way functions and the non-isomorphism of NP-complete sets. Theoretical Computer Science, 81(1):155–163, 1991.Google Scholar
  7. [JPY88]
    D. Johnson, C. Papadimitriou, and M. Yannakakis. How easy is local search? J. Comput. System Sci., 37:79–100, 1988.Google Scholar
  8. [LL78]
    N. Lynch and R. Lipton. On structure preserving reductions. SIAM J. Comp., 7(2):119–125, 1978.Google Scholar
  9. [Sim75]
    J. Simon. On some central problems in computational complexity. Technical report, Cornell University, Ithaca NY, 1975. TR 75-224.Google Scholar
  10. [Val79a]
    L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189–201, 1979.CrossRefGoogle Scholar
  11. [Val79b]
    L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410–421, 1979.CrossRefGoogle Scholar
  12. [VV85]
    L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. In Proc. 17th ACM Symp. Theory of Computing, pages 458–463, 1985.Google Scholar
  13. [Zan91]
    V. Zankó. #P-completeness via many-one reductions. International Journal of Foundations of Computer Science, 2(1):76–82, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Sophie Fischer
    • 1
  • Lane Hemaspaandra
    • 2
  • Leen Torenvliet
    • 1
  1. 1.Department of Computer ScienceUniversity of AmsterdamTV Amsterdam
  2. 2.Department Computer ScienceUniversity of RochesterRochester

Personalised recommendations