Sparse Solutions of Linear Diophantine Equations (Q5737776): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Iskander M. Aliev / rank
Normal rank
 
Property / author
 
Property / author: Iskander M. Aliev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.00344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Siegel's Lemma and sum-distinct sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Approximation Algorithms for the Nearest Codeword Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set of elasticities in numerical monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Siegel's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to an integer analogue of Carathéodory's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (co)girth of a connected matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer analogue of Carathéodory's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carathéodory bounds for integer cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3234565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorization invariants and Hilbert functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of polynomials with an application to Siegel's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and commutative algebra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best constant in Siegel's Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:17, 13 July 2024

scientific article; zbMATH DE number 6724189
Language Label Description Also known as
English
Sparse Solutions of Linear Diophantine Equations
scientific article; zbMATH DE number 6724189

    Statements

    Sparse Solutions of Linear Diophantine Equations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2017
    0 references
    optimization
    0 references
    discrete geometry
    0 references
    integer programming
    0 references

    Identifiers