An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988688790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on equivalent systems of linear diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the minimum solutions of linear Diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer matrix diagonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Aggregation of Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375622 / rank
 
Normal rank

Latest revision as of 09:57, 28 June 2024

scientific article
Language Label Description Also known as
English
An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))
scientific article

    Statements

    An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (English)
    0 references
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    approximation algorithm
    0 references
    computational complexity
    0 references
    GCD
    0 references
    NP-hard
    0 references
    number-theoretic problems
    0 references
    probabilistically checkable proofs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references