• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1995 Fiscal Year Final Research Report Summary

Test Instance Generation for NP-Search Problems

Research Project

Project/Area Number 06680308
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 計算機科学
Research InstitutionTOKYO INSTITUTE OF TECHNOLOGY

Principal Investigator

WATANABE Osamu  Tokyo Institute of Technology, Graduate School of Information Science and Engineering, Associate Professor, 大学院・情報理工学研究科, 助教授 (80158617)

Project Period (FY) 1994 – 1995
KeywordsNP Problem / Search Algoritum / Algorithm Test / Test Instance Generation / Average-Case Complexity
Research Abstract

In this project, we first established a mathematical framework for discussing test instance generation problems and the intrinsic difficulty of such problems.
Some of the essential points were found through this investigation. For example, we showed that the test instance generation for Tiling Problem under a certain uniform distribution is essential for all test instance generation problems. More specifically, we showed the following result : if the test instance generation for Tiling Problem under TILE this uniform distribution is feasible, then test instance generation is feasible for every NP search problem and every reasonable distribution. This result and the framework is summarized in [1].
In this theoretical framework and using several technical results, we investigated test instance generation for some concrete NP search problem. We consider the test instance generation for SAT,Satisfiability Problem, under a certain uniform distribution. We proposed some test instance generation algorithms, and proved their effectiveness. We then investigated their performance experimentally. These results are now being summarized for a technical paper.
On the other hand, the average-case complexity of NP and related problems is also investigated. We found some gap between NP search problems and NP optimization problems. In fact, we were able to characterize this difference in terms of the difficulty of generating (test) instances for those problems. This result is summarized in [2].

  • Research Products

    (4 results)

All Other

All Publications (4 results)

  • [Publications] Osawa Watanabe: "Test instance generation for promised.NP search problems" Proc.9th IEEE Structure in Complexity Theory. 205-216 (1994)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Osamu Watanabe,Rainer Schuler: "Towards averge-case analysis of NP optimization problems" Proc.10th IEEE Structure in Complexity Theory. 148-161 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] O.Watanabe: "Test instance generation for promised NP search problems" in Proc.9th Structure in Complexity Theory Conference, IEEE,New York. 205-216 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] R.Schuler and O.Watanabe: "Towards average-case analysis of NP optimization problems" in Proc.10th Structure in Complexity Theory Conference, IEEE,New York. 148-161 (1995)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1997-03-04  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi