课题基金 / 基金详情

ITR Collaborative Research: ASE-DMC Computational complexity for interactive computing

ITR Collaborative Research: ASE-DMC Computational complexity for interactive computing
ITR 协作研究:ASE-DMC 交互式计算的计算复杂性
批准号:
0426858
负责人:
Fan Chung Graham
金额:
$0.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2004
资助国家:
美国
项目状态:
已结题
起止时间:
2004-09-15 至 2009-08-31

项目摘要

项目成果

Fan Chung Graham的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
In the rapidly growing world of Internet infrastructures, we face many challenging new problems. These arise in part because the usual assumptions made in problems of this general type may no longer hold. For example, many typical questions dealing with massive data sets often involve networks or graphs of prohibitively large sizes. Only partial information can be obtained and in addition, this information is changing dynamically. There is an increasing need to develop the theoretical foundation for these myriad complex processes. In particular, there are many unresolved fundamental issues regarding the computational and informational-theoretic complexity of interactive computing, both in the classical setting as well as other emerging computational paradigms. In this proposal, we will investigate severalinter-related areas :- Major open problems in communication complexity.- Two information-theoretic identification problems Guessing secrets and Finding favorites.- Two directions in quantum information processing quantum decision tree model and quantum communication complexity.- Using techniques in the study of the so-called "power law model" for realistic networksto develop new methods in the analysis of on-line algorithms. Impact Interactive computing is prevalent in almost all areas of computing and communcations with applications in numerous areas of science and engineering, such as security, finance, information retrieval, bioinformatics and beyond. However, the current state of the theoretical foundation for interactive computation is quite primitive and far from satisfactory. The proposed study on the computational complexity of interactive computation is meant to strengthen our understanding and provide insight that is crucial for the design and analysis of interactive algorithms. Because of the fundamental and far-reaching nature of the proposed work, this study will help bring together different areas and crossfertilization typically occur.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Collaborative Research: STEM Real World Applications of Mathematics
  • 批准号:
    1020548
  • 项目类别:
    Standard Grant
  • 资助金额:
    $13.2万
  • 财政年份:
    2010
  • 负责人:
    Fan Chung Graham
  • 依托单位:
Research Dissemination through Organizing Workshops
  • 批准号:
    0731753
  • 项目类别:
    Standard Grant
  • 资助金额:
    $2.0万
  • 财政年份:
    2007
  • 负责人:
    Fan Chung Graham
  • 依托单位:
Spectral and probabilistic methods for large sparse graphs
  • 批准号:
    0457215
  • 项目类别:
    Standard Grant
  • 资助金额:
    $0.0万
  • 财政年份:
    2005
  • 负责人:
    Fan Chung Graham
  • 依托单位:
Spectral, Extremal & Probabilistic Methods in Graph Theory with Applications to Information Technology
  • 批准号:
    0100472
  • 项目类别:
    Standard Grant
  • 资助金额:
    $11.83万
  • 财政年份:
    2001
  • 负责人:
    Fan Chung Graham
  • 依托单位:
海外基金