首页 > 最新文献

Computational Complexity最新文献

英文 中文
Rank and border rank of Kronecker powers of tensors and Strassen's laser method 张量Kronecker幂的秩和边秩及Strassen激光法
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-09-10 DOI: 10.1007/s00037-021-00217-y
Austin Conner, Fulvio Gesmundo, J. Landsberg, Emanuele Ventura
{"title":"Rank and border rank of Kronecker powers of tensors and Strassen's laser method","authors":"Austin Conner, Fulvio Gesmundo, J. Landsberg, Emanuele Ventura","doi":"10.1007/s00037-021-00217-y","DOIUrl":"https://doi.org/10.1007/s00037-021-00217-y","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48477139","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
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling Nullstellensatz大小程度的权衡可逆卵石
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-07-17 DOI: 10.1007/s00037-020-00201-y
Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere
{"title":"Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling","authors":"Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere","doi":"10.1007/s00037-020-00201-y","DOIUrl":"https://doi.org/10.1007/s00037-020-00201-y","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-020-00201-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47375320","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
A quadratic lower bound for homogeneous algebraic branching programs 齐次代数分支程序的二次下界
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-06-08 DOI: 10.1007/s00037-019-00186-3
Mrinal Kumar
{"title":"A quadratic lower bound for homogeneous algebraic branching programs","authors":"Mrinal Kumar","doi":"10.1007/s00037-019-00186-3","DOIUrl":"https://doi.org/10.1007/s00037-019-00186-3","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"1 1","pages":"1-27"},"PeriodicalIF":1.4,"publicationDate":"2019-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-019-00186-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44065389","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}
引用次数: 17
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach 深度-4下界，确定性复杂性:一种统一的方法
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-05-28 DOI: 10.1007/s00037-019-00185-4
S. Chillara, P. Mukhopadhyay
{"title":"Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach","authors":"S. Chillara, P. Mukhopadhyay","doi":"10.1007/s00037-019-00185-4","DOIUrl":"https://doi.org/10.1007/s00037-019-00185-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"545 - 572"},"PeriodicalIF":1.4,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-019-00185-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809819","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
Zeros and approximations of Holant polynomials on the complex plane 复平面上Holant多项式的零点和近似
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-05-08 DOI: 10.1007/s00037-022-00226-5
Katrin Casel, Philipp Fischbeck, T. Friedrich, Andreas Göbel, J. Lagodzinski
{"title":"Zeros and approximations of Holant polynomials on the complex plane","authors":"Katrin Casel, Philipp Fischbeck, T. Friedrich, Andreas Göbel, J. Lagodzinski","doi":"10.1007/s00037-022-00226-5","DOIUrl":"https://doi.org/10.1007/s00037-022-00226-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46867010","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
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials 常深度电路和多项式量化去随机化的改进界
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-04-22 DOI: 10.1007/s00037-019-00179-2
R. Tell
{"title":"Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials","authors":"R. Tell","doi":"10.1007/s00037-019-00179-2","DOIUrl":"https://doi.org/10.1007/s00037-019-00179-2","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"259-343"},"PeriodicalIF":1.4,"publicationDate":"2019-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-019-00179-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45667001","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}
引用次数: 12
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds 部分信息和后验预测及其在电路下界中的应用
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-04-06 DOI: 10.1007/s00037-019-00177-4
Or Meir, A. Wigderson
{"title":"Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds","authors":"Or Meir, A. Wigderson","doi":"10.1007/s00037-019-00177-4","DOIUrl":"https://doi.org/10.1007/s00037-019-00177-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"145 - 183"},"PeriodicalIF":1.4,"publicationDate":"2019-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-019-00177-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46055772","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
Lower Bounds for Matrix Factorization 矩阵分解的下界
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-04-01 DOI: 10.1007/s00037-021-00205-2
Mrinal Kumar, Ben lee Volk
{"title":"Lower Bounds for Matrix Factorization","authors":"Mrinal Kumar, Ben lee Volk","doi":"10.1007/s00037-021-00205-2","DOIUrl":"https://doi.org/10.1007/s00037-021-00205-2","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-021-00205-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44944673","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
The hardest halfspace 最硬的半空间
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2019-02-05 DOI: 10.1007/s00037-021-00211-4
Alexander A. Sherstov
{"title":"The hardest halfspace","authors":"Alexander A. Sherstov","doi":"10.1007/s00037-021-00211-4","DOIUrl":"https://doi.org/10.1007/s00037-021-00211-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"30 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-021-00211-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44711993","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}
引用次数: 5
Expander-Based Cryptography Meets Natural Proofs 基于扩展器的密码学满足自然证明
IF 1.4 3区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Computational Complexity
Pub Date : 2018-12-21 DOI: 10.1007/s00037-022-00220-x
I. Oliveira, R. Santhanam, R. Tell
{"title":"Expander-Based Cryptography Meets Natural Proofs","authors":"I. Oliveira, R. Santhanam, R. Tell","doi":"10.1007/s00037-022-00220-x","DOIUrl":"https://doi.org/10.1007/s00037-022-00220-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2018-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44043733","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
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Computational Complexity
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1