Systems of distinct representatives and linear algebra

Cited in

(only showing first 100 items - show all)

Brick decompositions and the matching rank of graphs
Factoring multivariate polynomials over finite fields
Solvability by radicals is in polynomial time
Some sequences associated with combinatorial structures
A strongly polynomial minimum cost circulation algorithm
Non-interval greedoids and the transposition property
Solving systems of linear equations over polynomials
Irreducibility of multivariate polynomials
Exact arborescences, matchings and cycles
Matching is as easy as matrix inversion
An application of simultaneous diophantine approximation in combinatorial optimization
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
Constructing a perfect matching is in random NC
A fully polynomial time projective method
A matroid on hypergraphs, with applications in scene analysis and geometry
Bracing cubic grids - a necessary condition
Network theory and transversal matroids
Complexity of linear programming
The image of weighted combinatorial problems
Random pseudo-polynomial algorithms for some combinatorial programming problems
On the spanning trees of weighted graphs
On the free matrix representation of transversal geometries
Combinatorial aspects of rectangular non-negative matrices
A computational basis for higher-dimensional computational geometry and applications
Matroids on partially ordered sets
The optimal path-matching problem
The computational complexity of some problems of linear algebra
On the computation of pfaffians
König's theorem and bimatroids
Some combinatorial-algebraic problems from complexity theory
Factorization properties of lattices over the integers
A primal-dual interior point method whose running time depends only on the constraint matrix
Algebraic and numerical techniques for the computation of matrix determinants
Extension of partial diagonals of matrices. II
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
Cardinality constrained minimum cut problems: complexity and algorithms.
Totally tight Chvatal-Gomory cuts
Constructive non-commutative rank computation is in deterministic polynomial time
Identifying lens spaces in polynomial time
On the rank and periodic rank of finite dynamical systems
Some recent results in combinatorial approaches to dynamical systems
Which pivot to solve linear systems?
Classical complexity and quantum entanglement
Some results involving the splitting operation on binary matroids
Expansive automata networks
Linear matroid intersection is in quasi-NC
Many-visits TSP revisited
Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties)
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices
Computing in combinatorial optimization
Edmonds' problem and the membership problem for orbit semigroups of quiver representations
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 2 submatrices
Frontiers of sphere recognition in practice
Computing valuations of the Dieudonné determinants
A cost-scaling algorithm for computing the degree of determinants
On a weighted linear matroid intersection algorithm by deg-det computation
Lee-Yang theorems and the complexity of computing averages
Feasible partition problem in reverse convex and convex mixed-integer programming
Partial matroid representations
Operator scaling: theory and applications
Matrix scaling and explicit doubly stochastic limits
The complexity of solution-free sets of integers for general linear equations
A note on locality of algebras
Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
Generalized Wong sequences and their applications to Edmonds' problems
A fast parallel algorithm for minimum-cost small integral flows
Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
An adaptable and extensible geometry kernel
Narrow sieves for parameterized paths and packings
Non-commutative Edmonds' problem and matrix semi-invariants
Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces
Extension of partial diagonals of matrices. I
Maps of matroids with applications
Note on separation from membership, and folklore
Quadratic programming is in NP
Simultaneous robust subspace recovery and semi-stability of quiver representations
On the complexity of finding tensor ranks
Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
On computational complexity of construction of c-optimal linear regression models over finite experimental domains
Exact and heuristic algorithms for semi-nonnegative matrix factorization
Subspace arrangements, graph rigidity and derandomization through submodular optimization
Solving minimum K-cardinality cut problems in planar graphs
On Chubanov's method for solving a homogeneous inequality system
Closedness of integer hulls of simple conic sets
On the implementation of combinatorial algorithms for the linear exchange market
Maximum Rank of Powers of a Matrix of a Given Pattern
A graph-theoretic approach to investigate structural and qualitative properties of systems: A survey
Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
Identifiability of a simultaneous equations model of economy: a structural view
Singular spaces of matrices and their application in combinatorics
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
A deterministic PTAS for the commutative rank of matrix spaces
Constructive non-commutative rank computation is in deterministic polynomial time
SOS is not obviously automatizable, even approximately
An improved version of Chubanov's method for solving a homogeneous feasibility problem
Polynomial algorithms for a class of linear programs
Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces

This page was built for publication: Systems of distinct representatives and linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5564386)