Work

More on average case vs approximation complexity

Year: 2004

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.2003.1238204

Author: M. Alekhnovich

Institution: Massachusetts Institute of Technology

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

FWCI: 2.173

Cites: 26

Cited by: 283

Related to: 10