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

Studies in Complexity and Cryptography最新文献

筛选
英文 中文
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard 求图广义15-解的最短移动序列是np困难的
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_1
Oded Goldreich
{"title":"Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_1","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_1","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"43 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":"133988483","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}
引用次数: 60
Another Proof That BPP Í PHmathcal{BPP}subseteq mathcal{PH} (and More) BPP的另一个证明Í PHmathcal{BPP}subseteq mathcal{PH}(以及更多)
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_6
Oded Goldreich, David Zuckerman
{"title":"Another Proof That BPP Í PHmathcal{BPP}subseteq mathcal{PH} (and More)","authors":"Oded Goldreich, David Zuckerman","doi":"10.1007/978-3-642-22670-0_6","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_6","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"35 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":"129705079","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}
引用次数: 73
Another Motivation for Reducing the Randomness Complexity of Algorithms 降低算法随机性复杂性的另一个动机
Studies in Complexity and Cryptography Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-22670-0_36
Oded Goldreich
{"title":"Another Motivation for Reducing the Randomness Complexity of Algorithms","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_36","DOIUrl":"https://doi.org/10.1007/978-3-642-22670-0_36","url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"32 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":"122254188","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}
引用次数: 3
首页 上一页
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学术官方微信