Image de couverture de livre

Computing the probability of intersection

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Barvinok, Alexander
Format:	Preprint
Publié:	2025
Sujets:	Probability Data Structures and Algorithms Combinatorics 60C05, 68Q87, 68W05, 30C15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the zeros of partition functions with multi-spin interactions
par: Barvinok, Alexander
Publié: (2024)

Optimal Hardness of Online Algorithms for Large Independent Sets
par: Gamarnik, David, et autres
Publié: (2025)

Fundamentals of Partial Rejection Sampling
par: Jerrum, Mark
Publié: (2021)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
par: Müller, Noela, et autres
Publié: (2024)

BFS versus DFS for random targets in ordered trees
par: Dimitrov, Stoyan, et autres
Publié: (2024)

A new lower bound for deterministic pop-stack-sorting
par: Bauer, Morgan, et autres
Publié: (2023)

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
par: Friedl, Katalin, et autres
Publié: (2025)

On the on-line coloring of unit interval graphs with proper interval representation
par: Curbelo, Israel R., et autres
Publié: (2024)

An Algorithm to Recover Shredded Random Matrices
par: Atamanchuk, Caelan, et autres
Publié: (2023)

The random $k$-SAT Gibbs uniqueness threshold revisited
par: Chatterjee, Arnab, et autres
Publié: (2025)

Limit theorems for fixed point biased permutations avoiding a pattern of length three
par: Chelikavada, Aksheytha, et autres
Publié: (2023)

Finding cliques and dense subgraphs using edge queries
par: Csóka, Endre, et autres
Publié: (2023)

A note on limits of sequences of binary trees
par: Grübel, Rudolf
Publié: (2023)

The Distributional Tail of Worst-Case Quickselect
par: Płecha, Witold
Publié: (2026)

On 3-colorability of (claw, diamond)-free graphs
par: Hodur, Nadzieja, et autres
Publié: (2026)

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)

Mean-Biased Processes for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
par: Komusiewicz, Christian, et autres
Publié: (2023)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
par: Roucairol, Milo, et autres
Publié: (2024)

Online coloring of short interval graphs and two-count interval graphs
par: Curbelo, Israel R.
Publié: (2024)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
par: Wang, Chen, et autres
Publié: (2023)

The Algorithmic Phase Transition of Random Graph Alignment Problem
par: Du, Hang, et autres
Publié: (2023)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
par: Guidotti, Nicolas L., et autres
Publié: (2023)

WalkSAT is linear on random 2-SAT
par: Berenbrink, Petra, et autres
Publié: (2024)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Algorithms for the ferromagnetic Potts model on expanders
par: Carlson, Charlie, et autres
Publié: (2022)

Reconfiguration of Independent Transversals
par: Buys, Pjotr, et autres
Publié: (2024)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Zero-free regions of partition functions with applications to algorithms and graph limits
par: Regts, Guus
Publié: (2015)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
par: Galby, Esther, et autres
Publié: (2024)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
par: Nasre, Meghana, et autres
Publié: (2023)

Convergence of the QuickVal Residual
par: Fill, James Allen, et autres
Publié: (2024)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
par: Li, Zhangsong
Publié: (2026)

Asymptotic size of the Karp-Sipser Core in Configuration Model
par: Chatterjee, Arnab, et autres
Publié: (2025)

On Conjectures concerning the Labeled Coupon Collector Problem
par: Barak-Pelleg, Dina, et autres
Publié: (2025)

Untangling Graphs on Surfaces
par: de Verdière, Éric Colin, et autres
Publié: (2023)

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
par: Bonnet, Édouard, et autres
Publié: (2024)