Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
Polynomially Bounded Minimization Problems which are Hard to Approximate.
Viggo Kann
Venue
A*
ICALP
Year
1993
Proceedings
ICALP
DBLP record
conf/icalp/Kann93 ↗
Browse the full
ICALP paper archive
.