咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 理学
    • 1 篇 数学
  • 1 篇 工学
    • 1 篇 计算机科学与技术...
    • 1 篇 软件工程

主题

  • 1 篇 holographic algo...
  • 1 篇 local constraint...
  • 1 篇 computational co...
  • 1 篇 #p-hard
  • 1 篇 boolean inputs
  • 1 篇 boolean function...
  • 1 篇 counting csp pro...
  • 1 篇 graph theory
  • 1 篇 #csp
  • 1 篇 general graphs
  • 1 篇 polynomial time ...
  • 1 篇 matchgates
  • 1 篇 planar graphs
  • 1 篇 match gate compu...
  • 1 篇 statistical phys...
  • 1 篇 exponential time...
  • 1 篇 constraint theor...
  • 1 篇 classification c...
  • 1 篇 real-valued symm...
  • 1 篇 complexity dicho...

机构

  • 1 篇 univ wisconsin m...
  • 1 篇 microsoft res as...
  • 1 篇 chinese acad sci...

作者

  • 1 篇 cai jin-yi
  • 1 篇 xia mingji
  • 1 篇 lu pinyan

语言

  • 1 篇 英文
检索条件"主题词=local constraint functions"
1 条 记 录,以下是1-10 订阅
排序:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
Holographic Algorithms with Matchgates Capture Precisely Tra...
收藏 引用
IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)
作者: Cai, Jin-Yi Lu, Pinyan Xia, Mingji Univ Wisconsin Madison WI 53706 USA Microsoft Res Asia Beijing Peoples R China Chinese Acad Sci Inst Software Beijing 100864 Peoples R China
Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong ... 详细信息
来源: 评论