An analysis of Monte Carlo algorithms for counting problems

DOI10.1007/BF02575896zbMath0604.68048MaRDI QIDQ1083200

B. George

Publication date: 1985

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

probabilistic algorithmsprobabilistic analysispolynomial timeworst-case time complexityIntersection Cardinality ProblemMonte Carlo approximationsUnion Cardinality Problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Importance sampling the union of rare events with an application to power systems analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Sulla complessita di alcuni problemi di conteggio
• Randomised algorithms
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Monte-Carlo approximation algorithms for enumeration problems
• The Complexity of Enumeration and Reliability Problems
• Network reliability and the factoring theorem

This page was built for publication: An analysis of Monte Carlo algorithms for counting problems