On the relation between the determinant and the permanent
From MaRDI portal
(Redirected from Publication:774932)
Cited in
(35)- The complexity of computing the permanent
- Some algebraic identities for the \({\alpha}\)-permanent
- On convertible complex matrices
- On Symmetric Matrices Whose Eigenvalues Satisfy Linear Inequalities
- Factor Sets for Doubly Stochastic Operators on a Hilbert Space
- A biography of Marvin Marcus
- A note on immanant preservers
- On the Gibson barrier for the Pólya problem
- Pólya convertibility problem for symmetric matrices
- On the Permanent and Maximal Characteristic Root of a Nonnegative Matrix
- On the Pólya conversion problem for permanents and determinants
- Generalized Matrix Functions
- Permanent and determinant
- Determinants and permanents of power matrices
- Arithmetic matrix operations that preserve conversion
- An identity between the determinant and the permanent of Hessenberg-type matrices
- A relation between the determinant and the permanent on singular matrices
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Bilinear factorizations subject to monomial equality constraints via tensor decompositions
- Permanent versus determinant over a finite field
- On the Pólya permanent problem over finite fields
- A note on the determinant and permanent problem
- A relationship between determinants and permanents
- Linear immanant converters on skew-symmetric matrices of order 4
- The integral of an invariant unimodal function over an invariant convex set—an inequality and applications
- Combinatorial analysis. (Matrix problems, choice theory)
- Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture
- Permanental compounds and permanents of (0,1)-circulants
- Conversion of the Permanent into the Determinant
- Feasible arithmetic computations: Valiant's hypothesis
- Algebraic complexity classes
- Matrix applications of a quadratic identity for decomposable symmetrized tensors
- Permanent Polya problem for additive surjective maps
- Linear Transformations that Preserve the Permanent
- A lower bound on determinantal complexity
This page was built for publication: On the relation between the determinant and the permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q774932)