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

Computational Complexity最新文献

筛选
英文 中文
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials 基于Schubert多项式的稀疏多元多项式插值
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-07-12 DOI: 10.1007/s00037-016-0142-y
Priyanka Mukhopadhyay, Youming Qiao
{"title":"Sparse multivariate polynomial interpolation on the basis of Schubert polynomials","authors":"Priyanka Mukhopadhyay, Youming Qiao","doi":"10.1007/s00037-016-0142-y","DOIUrl":"https://doi.org/10.1007/s00037-016-0142-y","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"881 - 909"},"PeriodicalIF":1.4,"publicationDate":"2016-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0142-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809577","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
Quantum Query Complexity of Almost All Functions with Fixed On-set Size 几乎所有固定集大小函数的量子查询复杂度
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-06-21 DOI: 10.1007/s00037-016-0139-6
A. Ambainis, Kazuo Iwama, M. Nakanishi, H. Nishimura, Rudy Raymond, S. Tani, Shigeru Yamashita
{"title":"Quantum Query Complexity of Almost All Functions with Fixed On-set Size","authors":"A. Ambainis, Kazuo Iwama, M. Nakanishi, H. Nishimura, Rudy Raymond, S. Tani, Shigeru Yamashita","doi":"10.1007/s00037-016-0139-6","DOIUrl":"https://doi.org/10.1007/s00037-016-0139-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"723 - 735"},"PeriodicalIF":1.4,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0139-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809534","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
The Value of Help Bits in Randomized and Average-Case Complexity 随机化和平均复杂度下的帮助位值
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-06-09 DOI: 10.1007/s00037-016-0135-x
Salman Beigi, O. Etesami, Amin Gohari
{"title":"The Value of Help Bits in Randomized and Average-Case Complexity","authors":"Salman Beigi, O. Etesami, Amin Gohari","doi":"10.1007/s00037-016-0135-x","DOIUrl":"https://doi.org/10.1007/s00037-016-0135-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"119 - 145"},"PeriodicalIF":1.4,"publicationDate":"2016-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0135-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809007","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
On the connection between interval size functions and path counting 论区间大小函数与路径计数的关系
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-06-02 DOI: 10.1007/s00037-016-0137-8
E. Bampas, Andreas Göbel, Aris Pagourtzis, Aris Tentes
{"title":"On the connection between interval size functions and path counting","authors":"E. Bampas, Andreas Göbel, Aris Pagourtzis, Aris Tentes","doi":"10.1007/s00037-016-0137-8","DOIUrl":"https://doi.org/10.1007/s00037-016-0137-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"421 - 467"},"PeriodicalIF":1.4,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0137-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809200","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
Sunflowers and Testing Triangle-Freeness of Functions 向日葵与函数的无三角性检验
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-05-30 DOI: 10.1007/s00037-016-0138-7
I. Haviv, Ning Xie
{"title":"Sunflowers and Testing Triangle-Freeness of Functions","authors":"I. Haviv, Ning Xie","doi":"10.1007/s00037-016-0138-7","DOIUrl":"https://doi.org/10.1007/s00037-016-0138-7","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"497 - 530"},"PeriodicalIF":1.4,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0138-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809521","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
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity 对KRW构成猜想的探讨:基于通信复杂度的三次公式下界
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-05-29 DOI: 10.1007/s00037-017-0159-x
Irit Dinur, Or Meir
{"title":"Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity","authors":"Irit Dinur, Or Meir","doi":"10.1007/s00037-017-0159-x","DOIUrl":"https://doi.org/10.1007/s00037-017-0159-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"27 1","pages":"375 - 462"},"PeriodicalIF":1.4,"publicationDate":"2016-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-017-0159-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809343","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}
引用次数: 47
Information-theoretic approximations of the nonnegative rank 非负秩的信息论近似
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-05-23 DOI: 10.1007/s00037-016-0125-z
Gábor Braun, Rahul Jain, Troy Lee, S. Pokutta
{"title":"Information-theoretic approximations of the nonnegative rank","authors":"Gábor Braun, Rahul Jain, Troy Lee, S. Pokutta","doi":"10.1007/s00037-016-0125-z","DOIUrl":"https://doi.org/10.1007/s00037-016-0125-z","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"147 - 197"},"PeriodicalIF":1.4,"publicationDate":"2016-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0125-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41900022","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}
引用次数: 19
Special issue “Computational Complexity Conference 2015” Guest Editors’ Foreword 特刊“计算复杂性会议2015”特刊特邀编者前言
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-04-20 DOI: 10.1007/s00037-016-0133-z
Zeev Dvir, David Zuckerman
{"title":"Special issue “Computational Complexity Conference 2015” Guest Editors’ Foreword","authors":"Zeev Dvir, David Zuckerman","doi":"10.1007/s00037-016-0133-z","DOIUrl":"https://doi.org/10.1007/s00037-016-0133-z","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"305 - 307"},"PeriodicalIF":1.4,"publicationDate":"2016-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0133-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808908","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
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions 不可压缩函数，相对误差提取器，和不确定性约简的力量
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-04-11 DOI: 10.1007/s00037-016-0128-9
B. Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
{"title":"Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions","authors":"B. Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang","doi":"10.1007/s00037-016-0128-9","DOIUrl":"https://doi.org/10.1007/s00037-016-0128-9","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"349 - 418"},"PeriodicalIF":1.4,"publicationDate":"2016-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0128-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808655","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
Connect Four and Graph Decomposition 连接四和图分解
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2016-02-25 DOI: 10.1007/s00037-016-0123-1
L. Evain, M. Lederer, B. Roune
{"title":"Connect Four and Graph Decomposition","authors":"L. Evain, M. Lederer, B. Roune","doi":"10.1007/s00037-016-0123-1","DOIUrl":"https://doi.org/10.1007/s00037-016-0123-1","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"25 1","pages":"815 - 848"},"PeriodicalIF":1.4,"publicationDate":"2016-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-016-0123-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51808517","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
首页 上一页 下一页 尾页
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学术官方微信