Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.

DOI10.1016/S0012-365X(03)00239-5zbMath1041.68051OpenAlexW2106973034MaRDI QIDQ1417580

Toshihide Ibaraki, Susumu Suzuki

Publication date: 5 January 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00239-5

zbMATH Keywords

Cartesian productAverage running timeSatisfiability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Polynomial-average-time satisfiability problems
• An Analysis of Backtracking with Search Rearrangement
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• An Average Time Analysis of Backtracking

This page was built for publication: Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.