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 条

[41] Introduction: social-cognitive complexity, computational models and theoretical frames
Kluever, Christina
Kluever, Jurgen
COMPUTATIONAL AND MATHEMATICAL ORGANIZATION THEORY, 2012, 18 (02) : 145 - 152
[42] Measuring impacts on species with models and metrics of varying ecological and computational complexity
Hallam, Christopher D.
Wintle, Brendan A.
Kujala, Heini
Whitehead, Amy L.
Nicholson, Emily
CONSERVATION BIOLOGY, 2020, 34 (06) : 1512 - 1524
[43] Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data
Lancia, Giuseppe
Serafini, Paolo
ALGORITHMS, 2021, 14 (08)
[44] Reducing the Computational Complexity of Multimicrophone Acoustic Models with Integrated Feature Extraction
Sainath, Tara N.
Narayanan, Arun
Weiss, Ron J.
Variani, Ehsan
Wilson, Kevin W.
Bacchiani, Michiel
Shafran, Izhak
17TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2016), VOLS 1-5: UNDERSTANDING SPEECH PROCESSING IN HUMANS AND MACHINES, 2016, : 1971 - 1975
[45] Phase singularities and filaments: Simplifying complexity in computational models of ventricular fibrillation
Clayton, RH
Zhuchkova, EA
Panfilov, AV
PROGRESS IN BIOPHYSICS & MOLECULAR BIOLOGY, 2006, 90 (1-3): : 378 - 398
[46] On the application of Kolmogorov complexity to the characterization and evaluation of computational models and complex systems
Campani, CAP
Menezes, PB
CISST '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON IMAGING SCIENCE, SYSTEMS, AND TECHNOLOGY, 2004, : 63 - 68
[47] Accuracy and computational complexity analysis of design models created by virtual sculpting
Zhang, Weihan
Peng, Xiaobo
Leu, Ming C.
Blackmore, Denis
PROCEEDINGS OF THE ASME COMPUTERS AND INFORMATION IN ENGINEERING DIVISION, 2005, : 63 - 69
[48] An introduction to computational complexity and statistical learning theory applied to nuclear models
Idini, Andrea
28TH INTERNATIONAL NUCLEAR PHYSICS CONFERENCE, INPC 2022, 2023, 2586
[49] Computational Models Reduce Complexity and Accelerate Insight Into Cardiac Signaling Networks
Yang, Jason H.
Saucerman, Jeffrey J.
CIRCULATION RESEARCH, 2011, 108 (01) : 85 - 97
[50] A COMPARISON OF THE PREDICTIVE ABILITY OF MODE CHOICE MODELS WITH VARIOUS LEVELS OF COMPLEXITY
TRAIN, KE
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1979, 13 (01) : 11 - 16

← 1 2 3 4 5 →