课题基金 / 基金详情

The Structure of Complete Sets And Honest Polynomial Reducibilities

The Structure of Complete Sets And Honest Polynomial Reducibilities
完备集结构与诚实多项式可约性
批准号:
8814339
负责人:
Steven Homer
金额:
$0.0万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1989
资助国家:
美国
项目状态:
已结题
起止时间:
1989-06-01 至 1991-11-30

项目摘要

项目成果

Steven Homer的其他基金

相似基金

相关文献

中文摘要
翻译
这个项目的目的是为了更好地理解几个被广泛研究的复杂类的完备集的性质和结构。特别要研究强多项式约简下的完备集以及这些集之间的p-同构的存在性。此外,还将研究诚实多项式的可约性和这些可约性的极小集。其目的是将复杂性理论中多项式可约性和公开问题的结构与递归理论的方法和结果联系起来。关于诚实多项式约简的极小集的存在性与P=?将研究NP问题。
英文摘要
This project is aimed at an improved understanding of properties and structure of complete sets for several, extensively studied complexity classes. In particular, complete sets under strong polynomial reductions and the existence of p-isomorphisms between these sets are to be studied. In addition, a study will be made of honest polynomial reducibilities and minimal sets for these reducibilities. The goal is to relate the structure of polynomial reducibilities and open problems in complexity theory to methods and results of recursion theory. The relationship between the existence of minimal sets with respect to honest polynomial reductions and the P=? NP problem will be studied.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
XPS: FULL: CCA: Collaborative Research: Automatically Scalable Computation
  • 批准号:
    1533663
  • 项目类别:
    Standard Grant
  • 资助金额:
    $35.0万
  • 财政年份:
    2015
  • 负责人:
    Steven Homer
  • 依托单位:
Quantum Computation and Complexity Theory
  • 批准号:
    9988310
  • 项目类别:
    Continuing grant
  • 资助金额:
    $22.95万
  • 财政年份:
    2000
  • 负责人:
    Steven Homer
  • 依托单位:
U.S.-Netherlands Cooperative Research in Complexity Theory (Computer Science)
  • 批准号:
    9123551
  • 项目类别:
    Standard Grant
  • 资助金额:
    $1.25万
  • 财政年份:
    1992
  • 负责人:
    Steven Homer
  • 依托单位:
The Structure of Complete Sets and Polynomial Reducibilities
  • 批准号:
    9103055
  • 项目类别:
    Standard Grant
  • 资助金额:
    $0.0万
  • 财政年份:
    1991
  • 负责人:
    Steven Homer
  • 依托单位:
海外基金