Skip to content

cs-conference-ranking.org

By subfield By rank Methodology

⌕ Search 971 venues

Home/STOC/Paper

The Approximability of NP-hard Problems.

Year1998

ProceedingsSTOC

DBLP recordconf/stoc/Arora98 ↗

Browse the full STOC paper archive.

Subfields

Artificial Intelligence
Machine Learning
Computer Vision
Natural Language Processing
Security and Privacy
Systems and Networking
Databases and Data Management
Data Science and Information Retrieval

Rank tiers

A*
A
B
C
National
Regional
Australasian
Unranked
Journal Published
Multiconference

About

Rankings from the CORE Conference Ranking. Publication records from the DBLP computer science bibliography. Not affiliated with either project.

Methodology and sources