An efficient algorithm for clustered integer least squares problems (Q4909726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the sphere-decoding algorithm I. Expected complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: ML Symbol Detection Based on the Shortest Path Algorithm for MIMO Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Wireless Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LLL algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Generalized Singular Value Decomposition / rank
 
Normal rank

Latest revision as of 08:00, 6 July 2024

scientific article; zbMATH DE number 6148036
Language Label Description Also known as
English
An efficient algorithm for clustered integer least squares problems
scientific article; zbMATH DE number 6148036

    Statements

    An efficient algorithm for clustered integer least squares problems (English)
    0 references
    0 references
    0 references
    21 March 2013
    0 references
    integer least squares
    0 references
    LLL algorithm
    0 references
    lattice reduction
    0 references
    NP-hard
    0 references
    sphere decoding algorithm
    0 references
    ordered successive interference cancellation
    0 references

    Identifiers

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