发布求助
文献互助 智能选刊 最新文献

Studies in Complexity and Cryptography最新文献

筛选
英文 中文
Testing Graph Blow-Up 测试图形放大
Studies in Complexity and Cryptography Pub Date : 2011-08-17 DOI: 10.1007/978-3-642-22670-0_18
Lidor Avigad, Oded Goldreich
{"title":"Testing Graph Blow-Up","authors":"Lidor Avigad, Oded Goldreich","doi":"10.1007/978-3-642-22670-0_18","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_18","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126878034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art 基于(增强)Trapdoor排列的非交互式零知识:最新进展
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_28
Oded Goldreich
{"title":"Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_28","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_28","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122680514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
Short Locally Testable Codes and Proofs 简短的局部可测试代码和证明
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_25
Oded Goldreich
{"title":"Short Locally Testable Codes and Proofs","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_25","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_25","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123225341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Basic Facts about Expander Graphs 关于扩展图的基本事实
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_30
Oded Goldreich
{"title":"Basic Facts about Expander Graphs","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_30","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_30","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115127555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Bravely, Moderately: A Common Theme in Four Recent Works 勇敢适度:近期四部作品的共同主题
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_26
Oded Goldreich
{"title":"Bravely, Moderately: A Common Theme in Four Recent Works","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_26","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_26","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Average Case Complexity, Revisited 平均案例复杂度，重访
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_29
Oded Goldreich
{"title":"Average Case Complexity, Revisited","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_29","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_29","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"17 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114020452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Randomness and Computation 随机性和计算性
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_33
Oded Goldreich
{"title":"Randomness and Computation","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_33","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_33","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123890761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Strong Proofs of Knowledge 强有力的知识证明
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_7
Oded Goldreich
{"title":"Strong Proofs of Knowledge","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_7","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_7","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Brief Introduction to Property Testing 性能测试简介
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_31
Oded Goldreich
{"title":"A Brief Introduction to Property Testing","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_31","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_31","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"128 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
Proving Computational Ability 证明计算能力
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_2
M. Bellare, Oded Goldreich
{"title":"Proving Computational Ability","authors":"M. Bellare, Oded Goldreich","doi":"10.1007/978-3-642-22670-0_2","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_2","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123036984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信