Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CADE
/
Paper
Decidability and Complexity of Finitely Closable Linear Equational Theories.
Christopher Lynch
,
Barbara Morawska
Venue
A
CADE
Year
2001
Proceedings
IJCAR
DBLP record
conf/cade/LynchM01 ↗
Browse the full
CADE paper archive
.