Pub Date : 2018-11-20DOI: 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}
Pub Date : 2018-11-07DOI: 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}
Pub Date : 2018-08-20DOI: 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}
Pub Date : 2018-06-29DOI: 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}
Pub Date : 2018-06-25DOI: 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}
Pub Date : 2018-06-22DOI: 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}
Pub Date : 2018-06-22DOI: 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}
Pub Date : 2018-05-28DOI: 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}
Pub Date : 2018-03-22DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：