Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Automating OBDD proofs is NP-hard.
Dmitry Itsykson
,
Artur Riazanov
Venue
B
MFCS
Year
2022
Proceedings
MFCS
DBLP record
conf/mfcs/ItsyksonR22 ↗
Browse the full
MFCS paper archive
.