Image de couverture de livre

The Compilability Thresholds of 2-CNF to OBDD

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Colnet, Alexis, Laarman, Alfons, Lee, Joon Hyung
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Discrete Mathematics Combinatorics Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the enumeration of signatures of XOR-CNF's
par: Creignou, Nadia, et autres
Publié: (2024)

Boltzmann Sampling for Powersets without an Oracle
par: Peyen, Jean
Publié: (2026)

Integrating High-Dimensional Functions Deterministically
par: Gamarnik, David, et autres
Publié: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

Strong spatial mixing for colorings on trees and its algorithmic applications
par: Chen, Zongchen, et autres
Publié: (2023)

Cycle-factors of regular graphs via entropy
par: Christoph, Micha, et autres
Publié: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
par: Bansal, Nikhil, et autres
Publié: (2025)

Probabilistic estimates of the diameters of the Rubik's Cube groups
par: Hirata, So
Publié: (2024)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
par: Gamarnik, David, et autres
Publié: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2026)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

Sharp Online Hardness for Large Balanced Independent Sets
par: Dhawan, Abhishek, et autres
Publié: (2025)

The Squishy Grid Problem
par: Cai, Zixi, et autres
Publié: (2025)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
par: Chang, Yeonsu, et autres
Publié: (2023)

Constructive l2-Discrepancy Minimization with Additive Deviations
par: Dutta, Kunal
Publié: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
par: de Berg, Mark, et autres
Publié: (2024)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
par: Liu, Jingcheng, et autres
Publié: (2026)

A Tight Bound on Localization of Electrical Flows
par: Gurel-Gurevich, Ori, et autres
Publié: (2026)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
par: Jain, Vishesh, et autres
Publié: (2026)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Faster Mixing of the Jerrum-Sinclair Chain
par: Chen, Xiaoyu, et autres
Publié: (2025)

Sink-free orientations: a local sampler with applications
par: Anand, Konrad, et autres
Publié: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
par: Nuti, Pranav, et autres
Publié: (2022)

Rumors on evolving graphs through stationary times
par: Bonasorte, Vicenzo
Publié: (2025)

Phase Transitions via Complex Extensions of Markov Chains
par: Liu, Jingcheng, et autres
Publié: (2024)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
par: Ingels, Florian, et autres
Publié: (2026)

Induced Cycles of Many Lengths
par: Chudnovsky, Maria, et autres
Publié: (2026)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Unsplittable Transshipments
par: Debgupta, Srinwanti, et autres
Publié: (2026)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2026)

Generating minimal redundant and maximal irredundant sets in incidence graphs
par: Castelo, Emanuel, et autres
Publié: (2026)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

EPTAS for Hard Graph Cut Problems for Dense Graphs
par: Deguchi, Kaisei, et autres
Publié: (2026)

Hardness of Burning Number Problem on Regular Graphs
par: Antony, Dhanyamol, et autres
Publié: (2026)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
par: Avila, Tatiana Rocha, et autres
Publié: (2026)

The Complexity of Homomorphism Reconstruction Revisited
par: Gervens, Timo, et autres
Publié: (2026)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Moderately beyond clique-width: reduced component max-leaf and related parameters
par: Bonnet, Édouard, et autres
Publié: (2026)