Copertina

Scalable Algorithms for Approximate DNF Model Counting

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Burkhardt, Paul, Harris, David G., Schmitt, Kevin T
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

Online Algorithms with Unreliable Guidance
di: Dallot, Julien, et al.
Pubblicazione: (2026)

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

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

Approximate Lifted Model Construction
di: Luttermann, Malte, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

The Model Counting Competition 2020
di: Fichte, Johannes K., et al.
Pubblicazione: (2020)

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

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

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

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

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

Multi-dimensional Approximate Counting
di: Wang, Dingyu
Pubblicazione: (2024)

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

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

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

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

Parallel Sampling via Counting
di: Anari, Nima, et al.
Pubblicazione: (2024)

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

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

Polynomial-Time Approximability of Constrained Reinforcement Learning
di: McMahan, Jeremy
Pubblicazione: (2025)

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

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

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

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

Fast EXP3 Algorithms
di: Sato, Ryoma, et al.
Pubblicazione: (2025)