Cover Image

Scalable Algorithms for Approximate DNF Model Counting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Burkhardt, Paul, Harris, David G., Schmitt, Kevin T
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Engineering an Efficient Approximate DNF-Counter
by: Soos, Mate, et al.
Published: (2024)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
by: Nakamura, Kengo, et al.
Published: (2026)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
by: Harris, Blake, et al.
Published: (2024)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
by: Pham, Canh V.
Published: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
by: la Tour, Max Dupré, et al.
Published: (2024)

Approximating Optimal Labelings for Temporal Connectivity
by: Carnevale, Daniele, et al.
Published: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
by: Harris, David G., et al.
Published: (2026)

DNF Learning via Locally Mixing Random Walks
by: Alman, Josh, et al.
Published: (2025)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
by: Sharma, Vidya Sagar
Published: (2023)

Online Algorithms with Unreliable Guidance
by: Dallot, Julien, et al.
Published: (2026)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
by: Almansoori, Mahmood K. M., et al.
Published: (2025)

Approximate Lifted Model Construction
by: Luttermann, Malte, et al.
Published: (2025)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
by: Tran, Tan D., et al.
Published: (2025)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
by: Panda, Atasi, et al.
Published: (2022)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
by: Nguyen, Hue T., et al.
Published: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
by: Ganian, Robert, et al.
Published: (2025)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
by: Luo, Chunyu, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
by: Fioravantes, Foivos, et al.
Published: (2025)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
by: Harris, David G.
Published: (2021)

The Model Counting Competition 2020
by: Fichte, Johannes K., et al.
Published: (2020)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

The Model Counting Competitions 2021-2023
by: Fichte, Johannes K., et al.
Published: (2025)

DNF formulas are efficiently testable with relative error
by: Chen, Xi, et al.
Published: (2026)

Scalable Algorithms for Individual Preference Stable Clustering
by: Mosenzon, Ron, et al.
Published: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
by: Yau, Morris, et al.
Published: (2023)

Multi-dimensional Approximate Counting
by: Wang, Dingyu
Published: (2024)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
by: de Wynter, Adrian
Published: (2020)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
by: Thejaswi, Suhas, et al.
Published: (2024)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
by: Plank, Benedikt M., et al.
Published: (2022)

Parallel Sampling via Counting
by: Anari, Nima, et al.
Published: (2024)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
by: Gupta, Aaryan, et al.
Published: (2023)

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

Enumerating models of DNF faster: breaking the dependency on the formula size
by: Capelli, Florent, et al.
Published: (2018)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
by: Ehimwenma, Kennedy E., et al.
Published: (2025)

Approximately Counting Knapsack Solutions in Subquadratic Time
by: Feng, Weiming, et al.
Published: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

Fast EXP3 Algorithms
by: Sato, Ryoma, et al.
Published: (2025)