Institutional Repository
| Does co-NP have short interactive proofs? | |
| R. B. Boppana; J. Hastad; S. Zachos | |
| 1987 | |
| Source | Information Processing Letters
 |
| Volume | 25Issue:2Pages:127 - 132 |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1293 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | R. B. Boppana,J. Hastad,S. Zachos. Does co-NP have short interactive proofs?[J]. Information Processing Letters,1987,25(2):127 - 132. |
| APA | R. B. Boppana,J. Hastad,&S. Zachos.(1987).Does co-NP have short interactive proofs?.Information Processing Letters,25(2),127 - 132. |
| MLA | R. B. Boppana,et al."Does co-NP have short interactive proofs?".Information Processing Letters 25.2(1987):127 - 132. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| bj01127762.pdf（553KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment