On the complexity of deciding typability in the relational algebra
From MaRDI portal
Publication:1777227
DOI10.1007/s00236-005-0162-6zbMath1065.68048OpenAlexW2060439566MaRDI QIDQ1777227
Publication date: 12 May 2005
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/963
Cites Work
This page was built for publication: On the complexity of deciding typability in the relational algebra