Publications

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All Lp. Norms

AuthID
P-00Y-N1K

Author(s)

Bennett, H

Cheraghchi, M

Guruswami, V

Ribeiro, J

Editor(s)

Servedio,RA;Saha,B

Document Type

Proceedings Paper

Year published

2023

Published

in PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023 in STOC, ISSN: 0737-8017

Pages: 553-566 (14)

Conference

55Th Annual Acm Symposium on Theory of Computing (Stoc) Part of the Acm Federated Computing Research Conference (Fcrc), Date: JUN 20-23, 2023, Location: Orlando, FL

Indexing

Wos^®

Scopus^®

Dblp^®/en/publications/view/1004595

Crossref^®

Google Scholar^®

Metadata
Sources

Publication Identifiers

DOI: 10.1145/3564246.3585214

DBLP: conf/stoc/BennettCG023

SCOPUS: 2-s2.0-85163075035

Wos: WOS:001064640700046

Source Identifiers

ISSN: 0737-8017

Export Publication Metadata

Marked List

Add to Marked List

Info

At this moment we don't have any links to full text documens.

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All Lp. Norms

Useful Links

Get Help

Federated Authentication (Click on the image)

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All Lp. Norms

Useful Links

Get Help