Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products (Q3438996): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial-average-time satisfiability problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s1571-0653(04)00409-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2175599175 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:28, 30 July 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
29 May 2007
0 references
Cartesian product
0 references
satisfiability problem
0 references
algorithm
0 references
average running time
0 references
