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

Computational Complexity最新文献

筛选
英文 中文
On Hitting-Set Generators for Polynomials that Vanish Rarely 关于稀疏消失多项式的碰撞集生成器
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2022-10-22 DOI: 10.1007/s00037-022-00229-2
Dean Doron, A. Ta-Shma, R. Tell
{"title":"On Hitting-Set Generators for Polynomials that Vanish Rarely","authors":"Dean Doron, A. Ta-Shma, R. Tell","doi":"10.1007/s00037-022-00229-2","DOIUrl":"https://doi.org/10.1007/s00037-022-00229-2","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-62"},"PeriodicalIF":1.4,"publicationDate":"2022-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43642740","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}
引用次数: 2
Improved Hitting Set for Orbit of ROABPs 改进了roabp轨道的命中设置
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2022-10-12 DOI: 10.1007/s00037-022-00230-9
Vishwas Bhargava, Sumanta K Ghosh
{"title":"Improved Hitting Set for Orbit of ROABPs","authors":"Vishwas Bhargava, Sumanta K Ghosh","doi":"10.1007/s00037-022-00230-9","DOIUrl":"https://doi.org/10.1007/s00037-022-00230-9","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-45"},"PeriodicalIF":1.4,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46624748","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
Amplification with One NP Oracle Query 一个NP Oracle查询的放大
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2022-02-05 DOI: 10.4230/LIPIcs.ICALP.2019.96
Thomas Watson
{"title":"Amplification with One NP Oracle Query","authors":"Thomas Watson","doi":"10.4230/LIPIcs.ICALP.2019.96","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICALP.2019.96","url":null,"abstract":"We provide a complete picture of the extent to which amplification of success probability is possible for randomized algorithms having access to one NP oracle query, in the settings of two-sided, onesided, and zero-sided error. We generalize this picture to amplifying one-query algorithms with q-query algorithms, and we show our inclusions are tight for relativizing techniques.","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-47"},"PeriodicalIF":1.4,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44501730","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
Amplification with One NP Oracle Query 一个NP Oracle查询的放大
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2022-02-05 DOI: 10.1007/s00037-021-00219-w
Thomas Watson
{"title":"Amplification with One NP Oracle Query","authors":"Thomas Watson","doi":"10.1007/s00037-021-00219-w","DOIUrl":"https://doi.org/10.1007/s00037-021-00219-w","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43346849","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
The complexity of approximating the complex-valued Potts model 复值Potts模型逼近的复杂性
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2022-02-03 DOI: 10.1007/s00037-021-00218-x
Andreas Galanis, L. A. Goldberg, Andrés Herrera-Poyatos
{"title":"The complexity of approximating the complex-valued Potts model","authors":"Andreas Galanis, L. A. Goldberg, Andrés Herrera-Poyatos","doi":"10.1007/s00037-021-00218-x","DOIUrl":"https://doi.org/10.1007/s00037-021-00218-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43027109","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
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs 对所有常度图Tseitin公式正则分辨率反驳的近似最优下界的修正
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2021-11-17 DOI: 10.1007/s00037-021-00216-z
D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
{"title":"Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs","authors":"D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov","doi":"10.1007/s00037-021-00216-z","DOIUrl":"https://doi.org/10.1007/s00037-021-00216-z","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2021-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48946839","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
On sets of linear forms of maximal complexity 关于最大复杂度的线性形式集
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2021-10-09 DOI: 10.1007/s00037-022-00234-5
M. Kaminski, I. Shparlinski, M. Waldschmidt
{"title":"On sets of linear forms of maximal complexity","authors":"M. Kaminski, I. Shparlinski, M. Waldschmidt","doi":"10.1007/s00037-022-00234-5","DOIUrl":"https://doi.org/10.1007/s00037-022-00234-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"32 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2021-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46604563","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
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs 所有常度图Tseitin公式正则分辨率反驳的近最优下界
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2021-08-27 DOI: 10.1007/s00037-021-00213-2
D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
{"title":"Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs","authors":"D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov","doi":"10.1007/s00037-021-00213-2","DOIUrl":"https://doi.org/10.1007/s00037-021-00213-2","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-021-00213-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43382025","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
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity 通信复杂性中的不确定性和随机布尔层次结构
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2021-07-02 DOI: 10.1007/s00037-021-00210-5
T. Pitassi, Morgan Shirley, Thomas Watson
{"title":"Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity","authors":"T. Pitassi, Morgan Shirley, Thomas Watson","doi":"10.1007/s00037-021-00210-5","DOIUrl":"https://doi.org/10.1007/s00037-021-00210-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2021-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-021-00210-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47006503","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}
引用次数: 4
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space 可逆卵石博弈及树状空间与一般分辨率空间的关系
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2021-05-01 DOI: 10.4230/LIPIcs.STACS.2020.60
J. Torán, Florian Wörz
{"title":"Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space","authors":"J. Torán, Florian Wörz","doi":"10.4230/LIPIcs.STACS.2020.60","DOIUrl":"https://doi.org/10.4230/LIPIcs.STACS.2020.60","url":null,"abstract":"We show a new connection between the clause space measure in tree-like resolution and the reversible pebble game on graphs. Using this connection, we provide several formula classes for which there is a logarithmic factor separation between the clause space complexity measure in tree-like and general resolution. We also provide upper bounds for tree-like resolution clause space in terms of general resolution clause and variable space. In particular, we show that for any formula F , its tree-like resolution clause space is upper bounded by space $$(pi)$$ ( π ) $$(log({rm time}(pi))$$ ( log ( time ( π ) ) , where $$pi$$ π is any general resolution refutation of F . This holds considering as space $$(pi)$$ ( π ) the clause space of the refutation as well as considering its variable space. For the concrete case of Tseitin formulas, we are able to improve this bound to the optimal bound space $$(pi)log n$$ ( π ) log n , where n is the number of vertices of the corresponding graph","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"30 1","pages":"1-37"},"PeriodicalIF":1.4,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44065246","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术官方微信