Pages that link to "Item:Q2375856"

The following pages link to A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph (Q2375856):

Displaying 7 items.

• Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
• Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
• The Graver complexity of integer programming (Q659795) (← links)
• On the Graver complexity of codimension \(2\) matrices (Q839711) (← links)
• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) (Q2301979) (← links)
• Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
• Asymptotic behavior of Markov complexity (Q6199053) (← links)