a direct construction of polynomial-size obdd proof of pigeon hole     problem

	a direct construction of polynomial-size obdd proof of pigeon hole problem
	Chen Wei; Zhang Wenhui
	2009
发表期刊	INFORMATION PROCESSING LETTERS
ISSN	0020-0190
卷号	109 期号:10 页码:472-477
关键词	Propositional Proof Systems Binary Decision Diagrams Pigeon Hole Problem Proof Complexity Computational Complexity
部门归属	Chen, Wei; Zhang, Wenhui Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China. Chen, Wei Chinese Acad Sci, Grad Univ, Sch Informat Sci & Engn, Beijing, Peoples R China.
学科领域	Computer Science ; Information Systems
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8032
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Chen Wei,Zhang Wenhui. a direct construction of polynomial-size obdd proof of pigeon hole problem[J]. INFORMATION PROCESSING LETTERS,2009,109(10):472-477.
APA	Chen Wei,&Zhang Wenhui.(2009).a direct construction of polynomial-size obdd proof of pigeon hole problem.INFORMATION PROCESSING LETTERS,109(10),472-477.
MLA	Chen Wei,et al."a direct construction of polynomial-size obdd proof of pigeon hole problem".INFORMATION PROCESSING LETTERS 109.10(2009):472-477.