Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon.
Jonas Holmerin
Venue
A*
STOC
Year
2002
Proceedings
STOC
DBLP record
conf/stoc/Holmerin02 ↗
Browse the full
STOC paper archive
.