Work

Hardness of approximations

Year: 1996

Type: article

Authors: Sanjeev Arora, Carsten Lund

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: W204341840

FWCI: 15.43

Cites:

Cited by: 190

Related to: 10