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

Computational Complexity最新文献

筛选
英文 中文
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound 近似非负秩等价于光滑矩形边界
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-11-20 DOI: 10.1007/s00037-018-0176-4
Gillat Kol, S. Moran, Amir Shpilka, A. Yehudayoff
{"title":"Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound","authors":"Gillat Kol, S. Moran, Amir Shpilka, A. Yehudayoff","doi":"10.1007/s00037-018-0176-4","DOIUrl":"https://doi.org/10.1007/s00037-018-0176-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"1-25"},"PeriodicalIF":1.4,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0176-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46732350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Interactive proofs and a Shamir-like result for real number computations 实数计算的交互式证明和类似shamir的结果
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-11-07 DOI: 10.1007/s00037-018-0174-6
Martijn Baartse, K. Meer
{"title":"Interactive proofs and a Shamir-like result for real number computations","authors":"Martijn Baartse, K. Meer","doi":"10.1007/s00037-018-0174-6","DOIUrl":"https://doi.org/10.1007/s00037-018-0174-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"437 - 469"},"PeriodicalIF":1.4,"publicationDate":"2018-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0174-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45400480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings 统计零知识与统计随机编码的关系
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-08-20 DOI: 10.1007/s00037-018-0170-x
B. Applebaum, Pavel Raykov
{"title":"On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings","authors":"B. Applebaum, Pavel Raykov","doi":"10.1007/s00037-018-0170-x","DOIUrl":"https://doi.org/10.1007/s00037-018-0170-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"573 - 616"},"PeriodicalIF":1.4,"publicationDate":"2018-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0170-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47607976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An Exponential Separation Between MA and AM Proofs of Proximity 相邻性的MA和AM证明之间的指数分离
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-06-29 DOI: 10.1007/s00037-021-00212-3
Tom Gur, Yang P. Liu, R. Rothblum
{"title":"An Exponential Separation Between MA and AM Proofs of Proximity","authors":"Tom Gur, Yang P. Liu, R. Rothblum","doi":"10.1007/s00037-021-00212-3","DOIUrl":"https://doi.org/10.1007/s00037-021-00212-3","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"30 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-021-00212-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44280378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli 计数分辨率：Dag样下界与不同模
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-06-25 DOI: 10.1007/s00037-020-00202-x
Fedor Part, Iddo Tzameret
{"title":"Resolution with Counting: Dag-Like Lower Bounds and Different Moduli","authors":"Fedor Part, Iddo Tzameret","doi":"10.1007/s00037-020-00202-x","DOIUrl":"https://doi.org/10.1007/s00037-020-00202-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-020-00202-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48987776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
The Power of Natural Properties as Oracles 自然财产作为神谕的力量
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-06-22 DOI: 10.1007/s00037-023-00241-0
R. Impagliazzo, Valentine Kabanets, Ilya Volkovich
{"title":"The Power of Natural Properties as Oracles","authors":"R. Impagliazzo, Valentine Kabanets, Ilya Volkovich","doi":"10.1007/s00037-023-00241-0","DOIUrl":"https://doi.org/10.1007/s00037-023-00241-0","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"32 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2018-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49009010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Communication Complexity with Small Advantage 通信复杂性与小优势
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-06-22 DOI: 10.1007/s00037-020-00192-w
Thomas Watson
{"title":"Communication Complexity with Small Advantage","authors":"Thomas Watson","doi":"10.1007/s00037-020-00192-w","DOIUrl":"https://doi.org/10.1007/s00037-020-00192-w","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"29 1","pages":"1-37"},"PeriodicalIF":1.4,"publicationDate":"2018-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-020-00192-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43355760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On semiring complexity of Schur polynomials 关于Schur多项式的半环复杂性
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-06-04 DOI: 10.1007/s00037-018-0169-3
S. Fomin, D. Grigoriev, Dorian Nogneng, É. Schost
{"title":"On semiring complexity of Schur polynomials","authors":"S. Fomin, D. Grigoriev, Dorian Nogneng, É. Schost","doi":"10.1007/s00037-018-0169-3","DOIUrl":"https://doi.org/10.1007/s00037-018-0169-3","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"27 1","pages":"595 - 616"},"PeriodicalIF":1.4,"publicationDate":"2018-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0169-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46957640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Quantum generalizations of the polynomial hierarchy with applications to QMA(2) 多项式层次的量子推广及其在QMA(2)中的应用
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-05-28 DOI: 10.1007/s00037-022-00231-8
Sevag Gharibian, M. Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
{"title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","authors":"Sevag Gharibian, M. Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka","doi":"10.1007/s00037-022-00231-8","DOIUrl":"https://doi.org/10.1007/s00037-022-00231-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-52"},"PeriodicalIF":1.4,"publicationDate":"2018-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43129872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
The Landscape of Communication Complexity Classes 通信复杂性类的景观
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2018-03-22 DOI: 10.1007/s00037-018-0166-6
Mika Göös, T. Pitassi, Thomas Watson
{"title":"The Landscape of Communication Complexity Classes","authors":"Mika Göös, T. Pitassi, Thomas Watson","doi":"10.1007/s00037-018-0166-6","DOIUrl":"https://doi.org/10.1007/s00037-018-0166-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"27 1","pages":"245 - 304"},"PeriodicalIF":1.4,"publicationDate":"2018-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0166-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信