Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CADE
/
Paper
Unification Algorithms Cannot be Combined in Polynomial Time.
Miki Hermann
,
Phokion G. Kolaitis
Venue
A
CADE
Year
1996
Proceedings
CADE
DBLP record
conf/cade/HermannK96 ↗
Browse the full
CADE paper archive
.