Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 12:33, 6 June 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
