Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. |
scientific article |
Statements
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (English)
0 references
5 January 2004
0 references
Cartesian product
0 references
Satisfiability problem
0 references
Average running time
0 references
