Work

The hardness of approximate optima in lattices, codes, and systems of linear equations

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1993.366815

Authors: S. Arora, L. Babai, J. Stern, Z. Sweedyk

Institutions: University of California, Berkeley, Princeton University, University of Chicago, École Normale Supérieure - PSL

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2132302072

FWCI: 7.129

Cites: 35

Cited by: 182

Related to: 10