中国科学院软件研究所机构知识库
Register
Email:
Passwd
验 证:
换一张
Have you forgotten your password? Log In
Advanced  
  Communities
  Subjects
  All Items
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
题名:
a computational proof of complexity of some restricted counting problems
作者: Jin-Yi Cai ; Pinyan Lu ; Mingji Xia
关键词: Holant problem ; Holographic reduction
刊名: Theoretical Computer Science
发表日期: 2010
页: -
收录类别: sciencedirect,ei
部门归属: a Computer Sciences Department, University of Wisconsin-Madison, Madison, WI 53706, USAb Microsoft Research Asia, Beijing, 100190, PR Chinac State Key Laboratory of Computer Science, Institute of Software, CAS, Beijing, 100190, PR China ;
语种: 英语
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/9648
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
a computational proof of complexity of some restricted counting problems.pdf（2593KB）----限制开放-- 联系获取全文

Recommended Citation:
Jin-Yi Cai,Pinyan Lu,Mingji Xia. a computational proof of complexity of some restricted counting problems[J]. Theoretical Computer Science,2010-01-01:-.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Jin-Yi Cai]'s Articles
[Pinyan Lu]'s Articles
[Mingji Xia]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Jin-Yi Cai]‘s Articles
[Pinyan Lu]‘s Articles
[Mingji Xia]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放，请您登录
您对该条目有什么异议，请填写以下表单，管理员会尽快联系您。
内 容：
Email：  *
单位：
验证码：   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题：
  * 
内 容：
Email：  *
验证码：   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 
Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace