中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 2009年期刊/会议论文
题名:
cfi construction and balanced graphs
作者: Zhou Xiang
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 3rd International Workshop on Frontiers in Algorithmics
会议日期: JUN 20-23,
出版日期: 2009
会议地点: Hefei, PEOPLES R CHINA
出版者: FRONTIERS IN ALGORITHMICS, PROCEEDINGS
出版地: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
收录类别: istp,ei,acm
ISSN: 0302-9743
ISBN: 978-3-642-02269-2
部门归属: Zhou, Xiang Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China.
英文摘要: In this article, we define a new variant of Cai-Furer-Immerman construction. With this construction and some conditions of Dawar and Richerby, we are able to show that inflationary fixed point logic with counting (IFP+C) does not capture PTIME on the class of balanced graphs.
语种: 英语
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8338
Appears in Collections:中科院软件所图书馆_2009年期刊/会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zhou Xiang. cfi construction and balanced graphs[C]. 见:3rd International Workshop on Frontiers in Algorithmics. Hefei, PEOPLES R CHINA. JUN 20-23,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhou Xiang]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhou Xiang]‘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-2017  中国科学院软件研究所 - Feedback
Powered by CSpace