Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FAW
/
Paper
NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k).
Tianyan Deng
,
Daoyun Xu
Venue
National
FAW
Year
2008
Proceedings
FAW
DBLP record
conf/faw/DengX08 ↗
Browse the full
FAW paper archive
.