Pages that link to "Item:Q1022600"
From MaRDI portal
The following pages link to Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600):
Displaying 5 items.
- The complexity of almost linear diophantine problems (Q753494) (← links)
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126) (← links)
- Inapproximability results for the minimum integral solution problem with preprocessing over \(\ell_{\infty}\) norm (Q1951564) (← links)
- Lower bounds for solving linear diophantine equations on random access machines (Q3771611) (← links)
- An extensive review of the literature using the Diophantine equations to study fuzzy set theory (Q6657739) (← links)
