Image de couverture de livre

Scalable Algorithms for Approximate DNF Model Counting

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Burkhardt, Paul, Harris, David G., Schmitt, Kevin T
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Engineering an Efficient Approximate DNF-Counter
par: Soos, Mate, et autres
Publié: (2024)

Simple and efficient four-cycle counting on sparse graphs
par: Burkhardt, Paul, et autres
Publié: (2023)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
par: Nakamura, Kengo, et autres
Publié: (2026)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

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

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

Approximating Optimal Labelings for Temporal Connectivity
par: Carnevale, Daniele, et autres
Publié: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
par: Harris, David G., et autres
Publié: (2026)

DNF Learning via Locally Mixing Random Walks
par: Alman, Josh, et autres
Publié: (2025)

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

Online Algorithms with Unreliable Guidance
par: Dallot, Julien, et autres
Publié: (2026)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
par: Almansoori, Mahmood K. M., et autres
Publié: (2025)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
par: Tran, Tan D., et autres
Publié: (2025)

Approximate Lifted Model Construction
par: Luttermann, Malte, et autres
Publié: (2025)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
par: Panda, Atasi, et autres
Publié: (2022)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
par: Luo, Chunyu, et autres
Publié: (2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
par: Fioravantes, Foivos, et autres
Publié: (2025)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
par: Harris, David G.
Publié: (2021)

The Model Counting Competition 2020
par: Fichte, Johannes K., et autres
Publié: (2020)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

The Model Counting Competitions 2021-2023
par: Fichte, Johannes K., et autres
Publié: (2025)

DNF formulas are efficiently testable with relative error
par: Chen, Xi, et autres
Publié: (2026)

Scalable Algorithms for Individual Preference Stable Clustering
par: Mosenzon, Ron, et autres
Publié: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
par: Yau, Morris, et autres
Publié: (2023)

Multi-dimensional Approximate Counting
par: Wang, Dingyu
Publié: (2024)

Fast Approximate Counting of Cycles
par: Censor-Hillel, Keren, et autres
Publié: (2024)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
par: de Wynter, Adrian
Publié: (2020)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
par: Thejaswi, Suhas, et autres
Publié: (2024)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
par: Plank, Benedikt M., et autres
Publié: (2022)

Parallel Sampling via Counting
par: Anari, Nima, et autres
Publié: (2024)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
par: Gupta, Aaryan, et autres
Publié: (2023)

Streaming Attention Approximation via Discrepancy Theory
par: Kochetkova, Ekaterina, et autres
Publié: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
par: McMahan, Jeremy
Publié: (2025)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
par: Ehimwenma, Kennedy E., et autres
Publié: (2025)

Enumerating models of DNF faster: breaking the dependency on the formula size
par: Capelli, Florent, et autres
Publié: (2018)

Approximately Counting Knapsack Solutions in Subquadratic Time
par: Feng, Weiming, et autres
Publié: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Fast EXP3 Algorithms
par: Sato, Ryoma, et autres
Publié: (2025)