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 条

[21] Understanding the Computational Complexity of Diverse Classes of Turing and Super-Turing Computational Models
Abdelmoumin, Ghada
Liu, Chunmei
Rawat, Danda
2023 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE, CSCI 2023, 2023, : 411 - 419
[22] Fixed interval scheduling: Models, applications, computational complexity and algorithms
Kovalyov, Mikhail Y.
Ng, C. T.
Cheng, T. C. Edwin
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (02) : 331 - 342
[23] HOSVD based computational complexity reduction of TS fuzzy models
Baranyi, P
Várkonyi-Kóczy, AR
Yam, Y
Michelberger, P
JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5, 2001, : 2482 - 2487
[24] On Qualitative Route Descriptions: Representation, Agent Models, and Computational Complexity
Westphal M.
Wölfl S.
Nebel B.
Renz J.
Journal of Philosophical Logic, 2015, 44 (2) : 177 - 201
[25] ON THE COMPUTATIONAL-COMPLEXITY OF ISING SPIN-GLASS MODELS
BARAHONA, F
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (10): : 3241 - 3253
[26] Computational models to explore the complexity of the epithelial to mesenchymal transition in cancer
Cortesi, Marilisa
Liverani, Chiara
Mercatali, Laura
Ibrahim, Toni
Giordano, Emanuele
WILEY INTERDISCIPLINARY REVIEWS-SYSTEMS BIOLOGY AND MEDICINE, 2020, 12 (06)
[27] Accurate Vegetation Models with Low Computational Complexity for Ray Tracing
Aksoy, Enes
Khan, Haroon
Chen, Yun
Raschkowski, Leszek
Thiele, Lars
Stanczak, Slawomir
2023 INTERNATIONAL MICROWAVE AND ANTENNA SYMPOSIUM, IMAS, 2023, : 226 - 229
[28] Managing computational complexity using surrogate models: a critical review
Alizadeh, Reza
Allen, Janet K.
Mistree, Farrokh
RESEARCH IN ENGINEERING DESIGN, 2020, 31 (03) : 275 - 298
[29] Cardiac lineage selection: integrating biological complexity into computational models
Foley, Ann
WILEY INTERDISCIPLINARY REVIEWS-SYSTEMS BIOLOGY AND MEDICINE, 2009, 1 (03) : 334 - 347
[30] Addressing chemical complexity with surrogate models in computational catalyst design
Ulissi, Zachary
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2018, 255

← 1 2 3 4 5 →