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 |
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: An Average Time Analysis of Backtracking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of Backtracking with Search Rearrangement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial-average-time satisfiability problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00239-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106973034 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10: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
5 January 2004
0 references
Cartesian product
0 references
Satisfiability problem
0 references
Average running time
0 references
