Hardness of approximating the closest vector problem with pre-processing (Q430834): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11H06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11Y16 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6050358 / rank
 
Normal rank
Property / zbMATH Keywords
 
lattices
Property / zbMATH Keywords: lattices / rank
 
Normal rank
Property / zbMATH Keywords
 
codes
Property / zbMATH Keywords: codes / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation
Property / zbMATH Keywords: approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
hardness
Property / zbMATH Keywords: hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
preprocessing
Property / zbMATH Keywords: preprocessing / rank
 
Normal rank

Revision as of 23:50, 29 June 2023

scientific article
Language Label Description Also known as
English
Hardness of approximating the closest vector problem with pre-processing
scientific article

    Statements

    Hardness of approximating the closest vector problem with pre-processing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    lattices
    0 references
    codes
    0 references
    approximation
    0 references
    hardness
    0 references
    preprocessing
    0 references