scientific article; zbMATH DE number 5839812

MaRDI QIDQ3067455zbMATH OpenFDO

Authors J. Andres Montoya

Publication date 21 January 2011

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3878359
• On the complexity of the permanent in various computational models
• Algebraic complexity theory. III: On the complexity of the computation of permanents
• Parameterized complexity of determinant and permanent
• On the complexity of theories of permutations
• Lower bounds for Pólya's problem on permanent
• Research problems
• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• Approximating the  -permanent
• The Computational Complexity of Immanants

Cited in

(1)

• Succinct Permanent Is NEXP-Hard with Many Hard Instances

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067455)