Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2021232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. |
scientific article; zbMATH DE number 2021232 |
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
0.83406115
0 references
0.8180521
0 references
0.8163782
0 references
0.8131286
0 references
0.8119346
0 references
0.8118211
0 references
0.81044126
0 references
0.8099766
0 references
