Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products

DOI10.1016/S1571-0653(04)00409-3zbMath1184.68272OpenAlexW2175599175MaRDI QIDQ3438996

Susumu Suzuki, Toshihide Ibaraki

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00409-3

zbMATH Keywords

algorithmsatisfiability problemCartesian productaverage running time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Permutations, words, matrices (05A05)

Cites Work

• Polynomial-average-time satisfiability problems
• CNF-Satisfiability Test by Counting and Polynomial Average Time

This page was built for publication: Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products