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

Computational Complexity最新文献

筛选
英文 中文
The Minimum Oracle Circuit Size Problem 最小Oracle电路大小问题
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-02-17 DOI: 10.1007/s00037-016-0124-0
E. Allender, D. Holden, Valentine Kabanets
{"title":"The Minimum Oracle Circuit Size Problem","authors":"E. Allender, D. Holden, Valentine Kabanets","doi":"10.1007/s00037-016-0124-0","DOIUrl":"https://doi.org/10.1007/s00037-016-0124-0","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"469 - 496"},"PeriodicalIF":1.4,"publicationDate":"2016-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0124-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808580","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}
引用次数: 36
Cryptographic Hardness of Random Local Functions 随机局部函数的密码硬度
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-12-22 DOI: 10.1007/s00037-015-0121-8
B. Applebaum
{"title":"Cryptographic Hardness of Random Local Functions","authors":"B. Applebaum","doi":"10.1007/s00037-015-0121-8","DOIUrl":"https://doi.org/10.1007/s00037-015-0121-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"667 - 722"},"PeriodicalIF":1.4,"publicationDate":"2015-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0121-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808461","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}
引用次数: 56
Constructive non-commutative rank computation is in deterministic polynomial time 构造非交换秩的计算是在确定多项式时间内完成的
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-12-11 DOI: 10.1007/s00037-018-0165-7
G. Ivanyos, Youming Qiao, K. Subrahmanyam
{"title":"Constructive non-commutative rank computation is in deterministic polynomial time","authors":"G. Ivanyos, Youming Qiao, K. Subrahmanyam","doi":"10.1007/s00037-018-0165-7","DOIUrl":"https://doi.org/10.1007/s00037-018-0165-7","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"27 1","pages":"561-593"},"PeriodicalIF":1.4,"publicationDate":"2015-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0165-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809357","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}
引用次数: 68
On the power of algebraic branching programs of width two 宽度为2的代数分支规划的幂
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-11-05 DOI: 10.1007/s00037-015-0114-7
E. Allender, Fengming Wang
{"title":"On the power of algebraic branching programs of width two","authors":"E. Allender, Fengming Wang","doi":"10.1007/s00037-015-0114-7","DOIUrl":"https://doi.org/10.1007/s00037-015-0114-7","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"217 - 253"},"PeriodicalIF":1.4,"publicationDate":"2015-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0114-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808317","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}
引用次数: 25
Relativizing small complexity classes and their theories 相对化小复杂度类及其理论
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-10-29 DOI: 10.1007/s00037-015-0113-8
Klaus Aehlig, S. Cook, Phuong Nguyen
{"title":"Relativizing small complexity classes and their theories","authors":"Klaus Aehlig, S. Cook, Phuong Nguyen","doi":"10.1007/s00037-015-0113-8","DOIUrl":"https://doi.org/10.1007/s00037-015-0113-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"177 - 215"},"PeriodicalIF":1.4,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0113-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808308","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}
引用次数: 10
Quantum commitments from complexity assumptions 来自复杂性假设的量子承诺
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-10-29 DOI: 10.1007/s00037-015-0116-5
A. Chailloux, Iordanis Kerenidis, Bill Rosgen
{"title":"Quantum commitments from complexity assumptions","authors":"A. Chailloux, Iordanis Kerenidis, Bill Rosgen","doi":"10.1007/s00037-015-0116-5","DOIUrl":"https://doi.org/10.1007/s00037-015-0116-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"103 - 151"},"PeriodicalIF":1.4,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0116-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808349","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}
引用次数: 15
Query Complexity in Errorless Hardness Amplification 无偏硬度放大中的查询复杂度
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-10-29 DOI: 10.1007/s00037-015-0117-4
Thomas Watson
{"title":"Query Complexity in Errorless Hardness Amplification","authors":"Thomas Watson","doi":"10.1007/s00037-015-0117-4","DOIUrl":"https://doi.org/10.1007/s00037-015-0117-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"24 1","pages":"823 - 850"},"PeriodicalIF":1.4,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0117-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808377","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
A thirty Year old conjecture about promise problems 30年前关于承诺问题的猜想
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-09-17 DOI: 10.1007/s00037-015-0107-6
Andrew Hughes, Debasis Mandal, A. Pavan, N. Russell, A. Selman
{"title":"A thirty Year old conjecture about promise problems","authors":"Andrew Hughes, Debasis Mandal, A. Pavan, N. Russell, A. Selman","doi":"10.1007/s00037-015-0107-6","DOIUrl":"https://doi.org/10.1007/s00037-015-0107-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"883 - 919"},"PeriodicalIF":1.4,"publicationDate":"2015-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0107-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808272","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
On the complexity of computing Kronecker coefficients 关于克罗内克系数计算的复杂性
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-09-02 DOI: 10.1007/s00037-015-0109-4
Igor Pak, G. Panova
{"title":"On the complexity of computing Kronecker coefficients","authors":"Igor Pak, G. Panova","doi":"10.1007/s00037-015-0109-4","DOIUrl":"https://doi.org/10.1007/s00037-015-0109-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"43 1","pages":"1 - 36"},"PeriodicalIF":1.4,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0109-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808283","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
Affine extractors over large fields with exponential error 具有指数误差的大场仿射提取器
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2015-09-02 DOI: 10.1007/s00037-015-0108-5
J. Bourgain, Zeev Dvir, Ethan Leeman
{"title":"Affine extractors over large fields with exponential error","authors":"J. Bourgain, Zeev Dvir, Ethan Leeman","doi":"10.1007/s00037-015-0108-5","DOIUrl":"https://doi.org/10.1007/s00037-015-0108-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"921 - 931"},"PeriodicalIF":1.4,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-015-0108-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808278","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}
引用次数: 7
首页 上一页
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学术官方微信