E. Hemaspaandra, L. Hemaspaandra, Holger Spakowski, O. Watanabe
{"title":"The Robustness of LWPP and WPP, with an Application to Graph Reconstruction","authors":"E. Hemaspaandra, L. Hemaspaandra, Holger Spakowski, O. Watanabe","doi":"10.1007/s00037-020-00197-5","DOIUrl":"https://doi.org/10.1007/s00037-020-00197-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"29 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2017-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-020-00197-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45818080","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}
{"title":"The Complexity of Approximating complex-valued Ising and Tutte partition functions","authors":"L. A. Goldberg, Heng Guo","doi":"10.1007/s00037-017-0162-2","DOIUrl":"https://doi.org/10.1007/s00037-017-0162-2","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"26 1","pages":"765 - 833"},"PeriodicalIF":1.4,"publicationDate":"2017-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-017-0162-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44745202","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}
{"title":"Linear Matroid Intersection is in Quasi-NC","authors":"R. Gurjar, T. Thierauf","doi":"10.1145/3055399.3055440","DOIUrl":"https://doi.org/10.1145/3055399.3055440","url":null,"abstract":"Given two matroids on the same ground set, the matroid intersection problem asks to find a common independent set of maximum size. In case of linear matroids, the problem had a randomized parallel algorithm but no deterministic one. We give an almost complete derandomization of this algorithm, which implies that the linear matroid intersection problem is in quasi-NC. That is, it has uniform circuits of quasi-polynomial size nO(logn)documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$n^{O(log n)}$$end{document} and O(polylog(n)) depth. Moreover, the depth of the circuit can be reduced to O(log2n) in case of zero characteristic fields. This generalizes a similar result for the bipartite perfect matching problem. Our main technical contribution is to derandomize the Isolation lemma for the family of common bases of two matroids. We use our isolation result to give a quasi-polynomial time blackbox algorithm for a special case of Edmonds' problem, i.e., singularity testing of a symbolic matrix, when the given matrix is of the form A0+A1x1+⋯+Amxmdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$A_{0} + A_{1 }x_{1} + cdots + A_{m} x_{m}$$end{document}, for an arbitrary matrix A0 and rank-1 matrices A1,A2,⋯,Amdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$A_{1}, A_{2}, dots, A_{m}$$end{document}. This can also be viewed as a blackbox polynomial identity testing algorithm for the corresponding determinant polynomial. Another consequence of this result is a deterministic solution to the maximum rank matrix completion problem. Finally, we use our result to find a deterministic representation for the union of linear matroids in quasi-NC.","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":1.4,"publicationDate":"2017-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3055399.3055440","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49037535","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}
{"title":"Query-to-Communication Lifting for PNP","authors":"Mika Göös, T. Pitassi, Thomas Watson","doi":"10.1007/s00037-018-0175-5","DOIUrl":"https://doi.org/10.1007/s00037-018-0175-5","url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"28 1","pages":"113-144"},"PeriodicalIF":1.4,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-018-0175-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46709610","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
