机构

• 软件研究所 [10]

采集方式

• OAI收割 [10]

内容类型

• 会议论文 [6]
• 期刊论文 [4]

发表日期

• 2013 [1]
• 2012 [1]
• 2011 [4]
• 2010 [2]
• 2009 [1]
• 2008 [1]
• 更多

学科主题

• Computer S... [2]
• Mathematic... [2]

筛选

浏览/检索结果: 共10条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Holographic algorithms by Fibonacci gates 期刊论文  OAI收割 Linear Algebra and Its Applications, 2013, 卷号: 438, 期号: 2, 页码: 690-707 Cai, Jin-Yi (1); Lu, Pinyan (2); Xia, Mingji (3)   |  收藏  |  浏览/下载：14/0  |  提交时间：2014/12/16 Fibonacci gates  Holographic algorithm  Counting problems  Dichotomy theorem  Signature theory  Matchgates   holographic reduction, interpolation and hardness 期刊论文  OAI收割 COMPUTATIONAL COMPLEXITY, 2012, 卷号: 21, 期号: 4, 页码: 573-604 Cai Jin-Yi; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：20/0  |  提交时间：2013/09/17 Holographic reduction  polynomial interpolation  #P-hard  counting complexity   the complexity of weighted boolean #csp modulo k 会议论文  OAI收割 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, Dortmund, Germany, March 10, 2011 - March 12, 2011 Guo Heng; Huang Sangxia; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：19/0  |  提交时间：2013/10/08 Computational complexity   holographic algorithms by fibonacci gates 会议论文  OAI收割 Cai Jin-Yi; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：13/0  |  提交时间：2011/10/10 Polynomial approximation   computational complexity of holant problems 期刊论文  OAI收割 SIAM Journal on Computing, 2011, 卷号: 40, 期号: 4, 页码: 1101-1132 Cai Jin-Yi; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：18/0  |  提交时间：2013/10/08 Boolean functions  Interpolation  Real variables   dichotomy for holant* problems of boolean domain 会议论文  OAI收割 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, CA, United states, 23-Jan Cai Jin-Yi; Lu Pinyan; Xia Mingji 收藏  |  浏览/下载：12/0  |  提交时间：2011/10/10 Algorithms  Polynomial approximation  Theorem proving   a computational proof of complexity of some restricted counting problems 期刊论文  OAI收割 Theoretical Computer Science, 2010, 页码: - Jin-Yi Cai; Pinyan Lu; Mingji Xia   |  收藏  |  浏览/下载：18/0  |  提交时间：2011/05/23 Holant problem  Holographic reduction   holographic algorithms with matchgates capture precisely tractable planar #csp 会议论文  OAI收割 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, NV, United states, 40839 Cai Jin-Yi; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：26/0  |  提交时间：2011/03/31 Boolean functions  Computer science  Graph theory  Graphic methods  Polynomial approximation   a computational proof of complexity of some restricted counting problems 会议论文  OAI收割 6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969 Cai Jin-Yi; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：20/0  |  提交时间：2011/03/20 Algebra   holographic algorithms by fibonacci gates and holographic reductions for hardness 会议论文  OAI收割 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, United states, 40841 Cai Jin-Yi; Lu Pinyan; Xia Mingji   |  收藏  |  浏览/下载：8/0  |  提交时间：2011/06/13 Computers  Hardness  Optical devices  Polynomial approximation