Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
On the Complexity of Genuinely Polynomial Computation.
Marek Karpinski
,
Friedhelm Meyer auf der Heide
Venue
B
MFCS
Year
1990
Proceedings
MFCS
DBLP record
conf/mfcs/KarpinskiH90 ↗
Browse the full
MFCS paper archive
.