Title: | #3-regular bipartite planar vertex cover is #p-complete |
Author: | Xia Mingji
; Zhao Wenbo
|
Conference Name: | 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
|
Conference Date: | MAY 15-20,
|
Issued Date: | 2006
|
Conference Place: | Beijing, PEOPLES R CHINA
|
Publisher: | THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
|
Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
Indexed Type: | sci
; istp
|
ISSN: | 0302-9743
|
ISBN: | 3-540-34021-1
|
Department: | Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Chinese Acad Sci, Beijing, Peoples R China.
|
Sponsorship: | Chinese Acad Sci, Inst Software, Univ Leeds, Univ Wisconsin, Natl Nat Sci Fdn China
|
English Abstract: | 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 |
Language: | 英语
|
Citation statistics: |
|
Content Type: | 会议论文
|
URI: | http://ir.iscas.ac.cn/handle/311060/12192
|
Appears in Collections: | 软件所图书馆_会议论文
|
There are no files associated with this item.
|
Recommended Citation: |
Xia Mingji,Zhao Wenbo. #3-regular bipartite planar vertex cover is #p-complete[C]. 见:3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006). Beijing, PEOPLES R CHINA. MAY 15-20,.
|
|
|