CSpace
PROOF OF RUEPPEL LINEAR COMPLEXITY CONJECTURE
DAI, ZD
1986-05-01
Source PublicationIEEE TRANSACTIONS ON INFORMATION THEORY
ISSN0018-9448
Volume32Issue:3Pages:440-443
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:A1986C236300019
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/27575
Collection中国科学院数学与系统科学研究院
Corresponding AuthorDAI, ZD
AffiliationCHINESE ACAD SCI,INST MATH,BEIJING,PEOPLES R CHINA
Recommended Citation
GB/T 7714
DAI, ZD. PROOF OF RUEPPEL LINEAR COMPLEXITY CONJECTURE[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,1986,32(3):440-443.
APA DAI, ZD.(1986).PROOF OF RUEPPEL LINEAR COMPLEXITY CONJECTURE.IEEE TRANSACTIONS ON INFORMATION THEORY,32(3),440-443.
MLA DAI, ZD."PROOF OF RUEPPEL LINEAR COMPLEXITY CONJECTURE".IEEE TRANSACTIONS ON INFORMATION THEORY 32.3(1986):440-443.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[DAI, ZD]'s Articles
Baidu academic
Similar articles in Baidu academic
[DAI, ZD]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[DAI, ZD]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.