Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FCT
/
Paper
Complexity Classes with Complete Problems Between P and NP-C.
Carme lvarez
,
Josep Daz
,
Jacobo Torn
Venue
B
FCT
Year
1989
Proceedings
FCT
DBLP record
conf/fct/AlvarezDT89 ↗
Browse the full
FCT paper archive
.