An analysis of Monte Carlo algorithms for counting problems
From MaRDI portal
Publication:1083200
DOI10.1007/BF02575896zbMath0604.68048MaRDI QIDQ1083200
Publication date: 1985
Published in: Calcolo (Search for Journal in Brave)
probabilistic algorithms; probabilistic analysis; polynomial time; worst-case time complexity; Intersection Cardinality Problem; Monte Carlo approximations; Union Cardinality Problem
68Q25: Analysis of algorithms and problem complexity