Parameterized complexity of determinant and permanent
From MaRDI portal
Publication:2207496
DOI10.1016/j.tcs.2020.08.031zbMath1454.68060OpenAlexW3084084758MaRDI QIDQ2207496
Publication date: 22 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.08.031
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the determinant of bipartite graphs
- Determinants of grids, tori, cylinders and Möbius ladders
- Determinants of box products of paths
- The complexity of computing the permanent
- Spektren endlicher Grafen
- Matrix multiplication via arithmetic progressions
- On characteristic and permanent polynomials of a matrix
- Improved bound for complexity of matrix multiplication
- Determinants of adjacency matrices of graphs
- Minimum permanents of doubly stochastic matrices with prescribed zero entries†
- Powers of tensors and fast matrix multiplication
- Determinant Expansions of Signed Matrices and of Certain Jacobians
- The Determinant of the Adjacency Matrix of a Graph
- Graphs and determinants
- Permanents of graphs with cut vertices
- $\mathcal{B}$-Partitions, determinant and permanent of graphs
- Determinants, Permanents and Bipartite Graphs
- Matrix permanent and quantum entanglement of permutation invariant states
- Permanents of matrices of signed ones
- On the adjacency matrix of a block graph
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
