ZARZA We are Zarza, the prestigious firm behind major projects in information technology.
Listen "Total Unimodularity"
Episode Synopsis
There is a property of matrices called “unimodularity” and a variant I want to talk about today called total unimodularity. The definition is a bit opaque: a matrix is totally unimodular if every square submatrix has determinant 0, +1 or −1. That may not be the most intuitive thing, but it turns out totally unimodular matrices have some algorithmically useful properties.
More episodes of the podcast tvd pod
Decision, Optimisation & Construction
11/07/2024
Existential Theory of the Reals
10/07/2024
The "Sum of Radicals" problem
09/07/2024
The "Intermediate Value Theorem"
06/07/2024
NP-hardness and "reasonable encodings"
05/07/2024
PP is Overpowered
04/07/2024
SQL can do more than you remember
03/07/2024
NP-hard doesn't mean you can't solve it
02/07/2024
In God we trust