Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets.
Michael I. Dekhtyar
Venue
B
MFCS
Year
1979
Proceedings
MFCS
DBLP record
conf/mfcs/Dekhtjar79 ↗
Browse the full
MFCS paper archive
.