New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems

DOI10.1007/BF01585571zbMath0844.90067OpenAlexW1531923420MaRDI QIDQ1906282

Alexander I. 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

zbMATH Keywords

hyperdeterminant\(k\)-dimensional assignment problem\(k\)-dimensional matching problem\(k\)-matroid intersection problemmatroid \(k\)-parity problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

The Grassmann-Berezin calculus and theorems of the matrix-tree type, A sign-reversing involution for an extension of Torelli's Pfaffian identity, Quantum hyperdeterminants and hyper-Pfaffians, Binary linear codes, dimers and hypermatrices, Generating functions and counting formulas for spanning trees and forests in hypergraphs, Ensemble averages when \(\beta \) is a square integer, An efficient tree decomposition method for permanents and mixed discriminants, Hyperdeterminantal expressions for Jack functions of rectangular shapes, Bounds on the number of connected components for tropical prevarieties, Hankel hyperdeterminants, rectangular Jack polynomials and even powers of the Vandermonde, Hyperdeterminantal point processes, Tensor slice rank and Cayley's first hyperdeterminant, Pfaffian and Hafnian identities in shuffle algebras

Cites Work

• On the computation of pfaffians
• Random pseudo-polynomial algorithms for exact matroid problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item