#3-regular bipartite planar vertex cover is #p-complete

ISCAS OpenIR

	#3-regular bipartite planar vertex cover is #p-complete
	Xia Mingji; Zhao Wenbo
	2006
会议名称	3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
页码	356-364
会议日期	MAY 15-20,
会议地点	Beijing, PEOPLES R CHINA
收录类别	sci ; istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-34021-1
部门归属	Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Chinese Acad Sci, Beijing, Peoples R China.
摘要	We generalize the polynomial interpolation method by giving a sufficient condition, which guarantees that the coefficients of a polynomial are uniquely determined by its values on a recurrence sequence. Using this method, we show that #3-Regul
主办者	Chinese Acad Sci, Inst Software, Univ Leeds, Univ Wisconsin, Natl Nat Sci Fdn China
语种	英语
WOS记录号	WOS:000238091800034
引用统计	被引频次：7[WOS] [WOS记录] [WOS相关记录]
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12192
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Xia Mingji,Zhao Wenbo. #3-regular bipartite planar vertex cover is #p-complete[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS,2006:356-364.