Permanent and determinant

DOI10.1016/0024-3795(87)90337-5zbMath0636.15003OpenAlexW2040174039MaRDI QIDQ1097929

Joachim von zur Gathen

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90337-5

zbMATH Keywords

dimensionsingular locusdeterminant functionpermanent functionp-complete

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (15)

A lower bound for the determinantal complexity of a hypersurface ⋮ Feasible arithmetic computations: Valiant's hypothesis ⋮ On two extremal matrix problems ⋮ Permanent versus determinant over a finite field ⋮ \(P\) versus \(NP\) and geometry ⋮ On the Pólya permanent problem over finite fields ⋮ Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Arithmetic matrix operations that preserve conversion ⋮ On the complexity of the permanent in various computational models ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ Determinants vs. algebraic branching programs ⋮ A note on the determinant and permanent problem ⋮ Algebraic Complexity Classes ⋮ A lower bound on determinantal complexity

Cites Work

• The complexity of computing the permanent
• On the relation between the determinant and the permanent
• Feasible arithmetic computations: Valiant's hypothesis
• Permanents
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permanent and determinant