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

Computational Complexity最新文献

筛选
英文 中文
Two-closures of supersolvable permutation groups in polynomial time 多项式时间上超可解置换群的两个闭包
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2020-06-01 DOI: 10.1007/s00037-020-00195-7
Ilia N. Ponomarenko, A. Vasil’ev
{"title":"Two-closures of supersolvable permutation groups in polynomial time","authors":"Ilia N. Ponomarenko, A. Vasil’ev","doi":"10.1007/s00037-020-00195-7","DOIUrl":"https://doi.org/10.1007/s00037-020-00195-7","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-020-00195-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48600362","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
Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond Vapnik–Chervonenkis维度镜头下的不连贯性：稀疏与超越
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2020-06-01 DOI: 10.1007/s00037-022-00225-6
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
{"title":"Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond","authors":"Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar","doi":"10.1007/s00037-022-00225-6","DOIUrl":"https://doi.org/10.1007/s00037-022-00225-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48216483","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 complexity of approximating the complex-valued Potts model 逼近复值波茨模型的复杂性
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2020-05-01 DOI: 10.4230/LIPIcs.MFCS.2020.36
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.4230/LIPIcs.MFCS.2020.36","DOIUrl":"https://doi.org/10.4230/LIPIcs.MFCS.2020.36","url":null,"abstract":"We study the complexity of approximating the partition function of the q-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum computing and phase transitions in statistical physics, recent work in approximate counting has shown that the behaviour in the complex plane, and more precisely the location of zeros, is strongly connected with the complexity of the approximation problem, even for positive real-valued parameters. Previous work in the complex plane by Goldberg and Guo focused on q = 2, which corresponds to the case of the Ising model; for q > 2, the behaviour in the complex plane is not as well understood and most work applies only to the real-valued Tutte plane. Our main result is a complete classification of the complexity of the approximation problems for all non-real values of the parameters, by establishing #P-hardness results that apply even when restricted to planar graphs. Our techniques apply to all q $$geq$$ ≥ 2 and further complement/refine previous results both for the Ising model and the Tutte plane, answering in particular a question raised by Bordewich, Freedman, Lovász and Welsh in the context of quantum computations.","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-94"},"PeriodicalIF":1.4,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42281150","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
Lower Bounds for Arithmetic Circuits via the Hankel Matrix 算术电路的Hankel矩阵下界
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2020-03-10 DOI: 10.1007/s00037-021-00214-1
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, O. Serre
{"title":"Lower Bounds for Arithmetic Circuits via the Hankel Matrix","authors":"Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, O. Serre","doi":"10.1007/s00037-021-00214-1","DOIUrl":"https://doi.org/10.1007/s00037-021-00214-1","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"30 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2020-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45130291","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
The Computational Complexity of Plethysm Coefficients 体积系数的计算复杂度
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2020-02-03 DOI: 10.1007/s00037-020-00198-4
N. Fischer, Christian Ikenmeyer
{"title":"The Computational Complexity of Plethysm Coefficients","authors":"N. Fischer, Christian Ikenmeyer","doi":"10.1007/s00037-020-00198-4","DOIUrl":"https://doi.org/10.1007/s00037-020-00198-4","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2020-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-020-00198-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44597555","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}
引用次数: 14
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs 关于有界度图的单侧误差强可检验图性质的刻画
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2020-01-20 DOI: 10.1007/s00037-019-00191-6
Hiro Ito, Areej Khoury, I. Newman
{"title":"On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs","authors":"Hiro Ito, Areej Khoury, I. Newman","doi":"10.1007/s00037-019-00191-6","DOIUrl":"https://doi.org/10.1007/s00037-019-00191-6","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"29 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2020-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-019-00191-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51809871","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
Schur Polynomials Do Not Have Small Formulas If the Determinant does not Schur多项式没有小公式如果行列式没有
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2019-11-28 DOI: 10.1007/s00037-023-00236-x
Prasad Chaugule, Mrinal Kumar, N. Limaye, C. K. Mohapatra, Adrian She, S. Srinivasan
{"title":"Schur Polynomials Do Not Have Small Formulas If the Determinant does not","authors":"Prasad Chaugule, Mrinal Kumar, N. Limaye, C. K. Mohapatra, Adrian She, S. Srinivasan","doi":"10.1007/s00037-023-00236-x","DOIUrl":"https://doi.org/10.1007/s00037-023-00236-x","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"32 1","pages":"1-47"},"PeriodicalIF":1.4,"publicationDate":"2019-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43047760","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
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas 代数分支规划与公式的二次下界
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2019-11-26 DOI: 10.1007/s00037-022-00223-8
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben lee Volk
{"title":"Quadratic Lower Bounds for Algebraic Branching Programs and Formulas","authors":"Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben lee Volk","doi":"10.1007/s00037-022-00223-8","DOIUrl":"https://doi.org/10.1007/s00037-022-00223-8","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45358655","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
A quasi-linear irreducibility test in K[[x]][y]documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathbb{K}[[x]][y]$$en K[[x]][y]documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amssymb} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathbb{K}[[x]][y]$$en
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2019-11-05 DOI: 10.1007/s00037-022-00221-w
A. Poteaux, Martin Weimann
{"title":"A quasi-linear irreducibility test in K[[x]][y]documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$mathbb{K}[[x]][y]$$en","authors":"A. Poteaux, Martin Weimann","doi":"10.1007/s00037-022-00221-w","DOIUrl":"https://doi.org/10.1007/s00037-022-00221-w","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42002160","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 versus Randomized Communication Complexity, with Efficient Players 量子与随机通信复杂性，高效参与者
IF 1.4 3区 计算机科学
Computational Complexity Pub Date : 2019-11-01 DOI: 10.1007/s00037-022-00232-7
Uma Girish, R. Raz, Avishay Tal
{"title":"Quantum versus Randomized Communication Complexity, with Efficient Players","authors":"Uma Girish, R. Raz, Avishay Tal","doi":"10.1007/s00037-022-00232-7","DOIUrl":"https://doi.org/10.1007/s00037-022-00232-7","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"31 1","pages":"1-44"},"PeriodicalIF":1.4,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45907399","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
首页 上一页 下一页 尾页
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学术官方微信