Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
Miroslav Chlebk
,
Janka Chlebkov
Venue
B
MFCS
Year
2004
Proceedings
MFCS
DBLP record
conf/mfcs/ChlebikC04 ↗
Browse the full
MFCS paper archive
.