Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
type: Item
instance of: scholarly article
title: Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
zbMATH Open document ID: 1041.68051
DOI: 10.1016/S0012-365X(03)00239-5
author: Susumu Suzuki
author: Toshihide Ibaraki
published in: Discrete Mathematics
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2021232
zbMATH Keywords: Cartesian product
zbMATH Keywords: Satisfiability problem
zbMATH Keywords: Average running time
MaRDI profile type: Publication
cites work: An Average Time Analysis of Backtracking
cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time
cites work: An Analysis of Backtracking with Search Rearrangement
cites work: Polynomial-average-time satisfiability problems
full work available at URL: s0012-365x(03)00239-5
OpenAlex ID: W2106973034
Recommended article: Q5461603
Recommended article: Q3576769
Recommended article: Worst-case Analysis of Set Union Algorithms
Recommended article: Recognizing Cartesian products in linear time
Recommended article: Amortized Analysis of Algorithms for Set Union with Backtracking
Recommended article: A linear-time algorithm for a special case of disjoint set union
Recommended article: Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Recommended article: Average-case analysis of algorithms using Kolmogorov complexity
Recommended article: A simple expected running time analysis for randomized ``divide and conquer'' algorithms
Recommended article: Q3685219
description: scientific article; zbMATH DE number 2021232