On the complexity of the permanent in various computational models

被引：5

作者：

Ikenmeyer, Christian ^{[1
]}

Landsberg, J. M. ^{[2
]}

机构：

[1] Max Planck Inst Informat, Saarland Informat Campus, Saarbrucken, Germany

[2] Texas A&M Univ, College Stn, TX 77843 USA

来源：

JOURNAL OF PURE AND APPLIED ALGEBRA | 2017年 / 221卷 / 12期

关键词：

D O I：

10.1016/j.jpaa.2017.02.008

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We answer a question in [14], showing the regular determinantal complexity of the determinant det(m) is O(m(3)). We answer questions in, and generalize results of [2], showing there is no rank one determinantal expression for perm or detm when m >= 3. Finally we state and prove several "folklore" results relating different models of computation. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：2911 / 2927

页数：17

共 50 条

[1] Computational complexity in language models
Savitch, W
[J]. ISSUES IN MATHEMATICAL LINGUISTICS, 1999, 47 : 183 - 191
[2] COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
Horowitz, Jonah
[J]. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2013, 23 (06) : 1521 - 1531
[3] Algorithms, complexity and computational models Preface
Chen, Jianer
Cooper, S. Barry
[J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (23) : 2457 - 2458
[4] Computational models of hemostasis: Degrees of complexity
Anand, M.
Panteleev, M. A.
Ataullakhanov, F. I.
[J]. APPLICATIONS IN ENGINEERING SCIENCE, 2022, 10
[5] On the computational complexity of cost efficiency analysis models
Jahanshahloo, G. R.
Soleimani-damaneh, M.
Mostafaee, A.
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) : 638 - 640
[6] On the computational complexity of the bidomain and the monodomain models of electrophysiology
Sundnes, Joakim
Nielsen, Bjorn Fredrik
Mardal, Kent Andre
Lines, Glenn Terje
Tveito, Aslak
[J]. ANNALS OF BIOMEDICAL ENGINEERING, 2006, 34 (07) : 1088 - 1097
[7] On the Computational Complexity of the Bidomain and the Monodomain Models of Electrophysiology
Joakim Sundnes
Bjørn Fredrik Nielsen
Kent Andre Mardal
Xing Cai
Glenn Terje Lines
Aslak Tveito
[J]. Annals of Biomedical Engineering, 2006, 34 : 1088 - 1097
[8] Reducing the computational complexity for whole word models
Soltau, Hagen
Liao, Hank
Sak, Hasim
[J]. 2017 IEEE AUTOMATIC SPEECH RECOGNITION AND UNDERSTANDING WORKSHOP (ASRU), 2017, : 63 - 68
[9] On computational complexity of invalidating structured uncertainty models
Toker, O
Chen, J
[J]. SYSTEMS & CONTROL LETTERS, 1998, 33 (03) : 199 - 207
[10] Lumped models of the cardiovascular system of various complexity
Jezek, Filip
Kulhanek, Tomas
Kalecky, Karel
Kofranek, Jiri
[J]. BIOCYBERNETICS AND BIOMEDICAL ENGINEERING, 2017, 37 (04) : 666 - 678

← 1 2 3 4 5 →