On the complexity of deciding typability in the relational algebra

DOI10.1007/s00236-005-0162-6zbMath1065.68048OpenAlexW2060439566MaRDI QIDQ1777227

Stijn Vansummeren

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

zbMATH Keywords

non-uniform constraint satisfaction

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Polymorphic type inference for the relational algebra
• The complexity of satisfiability problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item