On the complexity of deciding typability in the relational algebra (Q1777227): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060439566 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4864249 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4855373 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2778806 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polymorphic type inference for the relational algebra / rank | |||
Normal rank | |||
Latest revision as of 11:27, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding typability in the relational algebra |
scientific article |
Statements
On the complexity of deciding typability in the relational algebra (English)
0 references
12 May 2005
0 references
non-uniform constraint satisfaction
0 references
