Institutional Repository
| a direct construction of polynomial-size obdd proof of pigeon hole problem | |
| Chen Wei; Zhang Wenhui | |
| 2009 | |
| Source | INFORMATION PROCESSING LETTERS
 |
| ISSN | 0020-0190 |
| Volume | 109Issue:10Pages:472-477 |
| Keyword | Propositional Proof Systems Binary Decision Diagrams Pigeon Hole Problem Proof Complexity Computational Complexity |
| Department | 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. |
| Subject | Computer Science ; Information Systems |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8032 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment