Pages that link to "Item:Q5874541"
From MaRDI portal
The following pages link to On the Computational Complexity of Linear Discrepancy (Q5874541):
Displaying 5 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Typical rounding problems (Q1884960) (← links)
- Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
- Roundings respecting hard constraints (Q2643143) (← links)
- STACS 2005 (Q5710713) (← links)