Pages that link to "Item:Q5917962"
From MaRDI portal
The following pages link to Matrices and matroids for systems analysis (Q5917962):
Displayed 34 items.
- Approximating clique-width and branch-width (Q2496203) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation (Q2867138) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices (Q3121390) (← links)
- Index Reduction via Unimodular Transformations (Q3176353) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- Structural Identifiability in Low-Rank Matrix Factorization (Q3511322) (← links)
- Some conditional probabilities in the TASEP with second class particles (Q4600230) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
- On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
- (Q5005108) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- Multiple Exchange Property for M<sup><i>♮</i></sup>-Concave Functions and Valuated Matroids (Q5219670) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- Integral with Respect to a Non Additive Measure: An Overview (Q5245085) (← links)
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils (Q5278177) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- On circuit valuation of matroids (Q5933469) (← links)
- Singular, nonsingular, and bounded rank completions of ACI-matrices (Q5962295) (← links)
- Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems (Q6052355) (← links)
- Representability of orthogonal matroids over partial fields (Q6119496) (← links)
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices (Q6120836) (← links)
- Presentations of transversal valuated matroids (Q6133798) (← links)