Pages that link to "Item:Q5626678"
From MaRDI portal
The following pages link to Minimization of ±1 matrices under line shifts (Q5626678):
Displayed 15 items.
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Balancing matrices with line shifts (Q795048) (← links)
- Large-determinant sign matrices of order \(4k+1\) (Q864164) (← links)
- A new approach to the covering radius of codes (Q1086543) (← links)
- The solution to Berlekamp's switching game (Q1115849) (← links)
- Some results for almost \(D\)-optimal experimental designs (Q1129421) (← links)
- Discrete ham sandwich theorems (Q1160184) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- General lower bounds on maximal determinants of binary matrices (Q1953493) (← links)
- Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1 (Q2056416) (← links)
- Quasi-random multilinear polynomials (Q2631886) (← links)
- (Q4561337) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- The Hardy-Littlewood Inequalities in Sequence Spaces (Q5888410) (← links)
- Upper bounds for the constants of Bennett's inequality and the Gale–Berlekamp switching game (Q6144273) (← links)