Pages that link to "Item:Q5564386"
From MaRDI portal
The following pages link to Systems of distinct representatives and linear algebra (Q5564386):
Displaying 50 items.
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Finding a low-rank basis in a matrix subspace (Q517309) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- The double pivot simplex method (Q684156) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection (Q792636) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Factoring multivariate polynomials over finite fields (Q1065867) (← links)
- Solvability by radicals is in polynomial time (Q1071803) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Non-interval greedoids and the transposition property (Q1079572) (← links)
- Solving systems of linear equations over polynomials (Q1082773) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- A fully polynomial time projective method (Q1104857) (← links)
- A matroid on hypergraphs, with applications in scene analysis and geometry (Q1109789) (← links)
- Bracing cubic grids - a necessary condition (Q1122584) (← links)
- Network theory and transversal matroids (Q1147102) (← links)
- Complexity of linear programming (Q1165154) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- Random pseudo-polynomial algorithms for some combinatorial programming problems (Q1194734) (← links)
- On the spanning trees of weighted graphs (Q1204524) (← links)
- On the free matrix representation of transversal geometries (Q1212940) (← links)
- Combinatorial aspects of rectangular non-negative matrices (Q1245964) (← links)
- A computational basis for higher-dimensional computational geometry and applications (Q1265288) (← links)
- Matroids on partially ordered sets (Q1271880) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- On the computation of pfaffians (Q1329786) (← links)
- König's theorem and bimatroids (Q1344070) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- Factorization properties of lattices over the integers (Q1345515) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Extension of partial diagonals of matrices. II (Q1393573) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
