Cover Image

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Zongchen, Galanis, Andreas, Goldberg, Leslie Ann, Guo, Heng, Herrera-Poyatos, Andrés, Mani, Nitya, Moitra, Ankur
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms 68W20, 68W25, 68W40, 68Q87 G.3; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
by: Rokhlin, Dmitry B.
Published: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Algorithms for Generating Small Random Samples
by: Cicirello, Vincent A.
Published: (2024)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

Exascale Multi-Task Graph Foundation Models for Imbalanced, Multi-Fidelity Atomistic Data
by: Pasini, Massimiliano Lupo, et al.
Published: (2026)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Algorithms Transcending the SAT-Symmetry Interface
by: Anders, Markus, et al.
Published: (2023)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
by: Mitchell, Rupert, et al.
Published: (2025)

satsuma: Structure-based Symmetry Breaking in SAT
by: Anders, Markus, et al.
Published: (2024)

Optimizing Genetic Algorithms Using the Binomial Distribution
by: Cicirello, Vincent A.
Published: (2024)