The following pages link to (Q2768281):
Displaying 6 items.
- \(L_{p}\) linear discrepancy of totally unimodular matrices (Q861031) (← links)
- The structure and number of global roundings of a graph (Q1884844) (← links)
- Typical rounding problems (Q1884960) (← links)
- Unimodular hypergraph for DNA sequencing: a polynomial time algorithm (Q2212678) (← links)
- Recent progress on combinatorics and algorithms for low discrepancy roundings (Q2373430) (← links)
- Set-Codes with Small Intersections and Small Discrepancies (Q5112823) (← links)