New algorithms for linear k-matroid intersection and matroid k-parity problems
From MaRDI portal
Publication:1906282
DOI10.1007/BF01585571zbMATH Open0844.90067OpenAlexW1531923420MaRDI QIDQ1906282FDOQ1906282
Authors: Alexander Barvinok
Publication date: 2 September 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585571
Recommendations
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Algebraic algorithms for linear matroid parity problems
- Algebraic algorithms for linear matroid parity problems
- Algebraic algorithms for matching and matroid problems
hyperdeterminant\(k\)-dimensional assignment problem\(k\)-dimensional matching problem\(k\)-matroid intersection problemmatroid \(k\)-parity problem
Cites Work
Cited In (18)
- A sign-reversing involution for an extension of Torelli's Pfaffian identity
- Hyperdeterminantal point processes
- Generating functions and counting formulas for spanning trees and forests in hypergraphs
- Title not available (Why is that?)
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Binary linear codes, dimers and hypermatrices
- Algebraic algorithms for matching and matroid problems
- Ensemble averages when \(\beta \) is a square integer
- Hyperdeterminantal expressions for Jack functions of rectangular shapes
- Hankel hyperdeterminants, rectangular Jack polynomials and even powers of the Vandermonde
- A parameterized view on matroid optimization problems
- An augmenting path algorithm for linear matroid parity
- Quantum hyperdeterminants and hyper-Pfaffians
- Pfaffian and Hafnian identities in shuffle algebras
- Bounds on the number of connected components for tropical prevarieties
- An efficient tree decomposition method for permanents and mixed discriminants
- Tensor slice rank and Cayley's first hyperdeterminant
This page was built for publication: New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906282)