中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 2010软件所会议论文
Title:
holographic reduction: a domain changed application and its partial converse theorems
Author: Xia Mingji
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 37th International Colloquium on Automata, Languages and Programming, ICALP 2010
Conference Date: 44018
Issued Date: 2010
Conference Place: Bordeaux, France
Keyword: Linguistics
Publish Place: Germany
Indexed Type: ei
ISSN: 3029743
ISBN: 3642141641
Department: (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100190, China
Sponsorship: CEA; Communaute Urbaine de Bordeaux; Conseil Regional dAquitaine; GDR Informatique Mathmatique (CNRS); INRIA; Total
English Abstract: Holographic reductions between some Holant problems and some #CSP(H d ) problems are built, where H d is some complex value binary function. By the complexity of these Holant problems, for each integer d≥2, #CSP(H d ) is in P when each variables appears at most d times, while it is #P-hard when each variables appears at most d+1 times. #CSP(H d ) counts weighted summation of graph homomorphisms from input graph G to graph H d , and the maximum occurrence of variables is the maximum degree of G. We conjecture the converse of holographic reduction holds for most of #Bi-restriction Constraint Satisfaction Problems, which can be regarded as a generalization of a known result about counting graph homomorphisms. It is proved that the converse of holographic reduction holds for some classes of problems. © 2010 Springer-Verlag Berlin Heidelberg.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/8790
Appears in Collections:中科院软件所图书馆_2010软件所会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
holographic reduction a domain changed application and its partial converse theorems.pdf(199KB)----限制开放-- 联系获取全文

Recommended Citation:
Xia Mingji. holographic reduction: a domain changed application and its partial converse theorems[C]. 见:37th International Colloquium on Automata, Languages and Programming, ICALP 2010. Bordeaux, France. 44018.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xia Mingji]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xia Mingji]‘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