scientific article; zbMATH DE number 7278113

DOI10.4230/LIPIcs.FSTTCS.2017.41zbMath1491.68193arXiv1710.05247MaRDI QIDQ5136333

Moshe Y. Vardi, Aditya A. Shrotri, Kuldeep S. Meel

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1710.05247

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationmodel countinghash functionsDNF

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Open-world probabilistic databases: semantics, algorithms, complexity ⋮ Not all FPRASs are equal: demystifying FPRASs for DNF-counting ⋮ Approximate weighted model integration on DNF structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing minimal independent support and its applications to sampling and counting
• Random generation of combinatorial structures from a uniform distribution
• On the hardness of approximate reasoning
• Short XORs for Model Counting: From Theory to Practice
• Monte-Carlo approximation algorithms for enumeration problems
• The Complexity of Enumeration and Reliability Problems
• An Optimal Algorithm for Monte Carlo Estimation

This page was built for publication: