Image de couverture de livre

Approximate Counting for Spin Systems in Sub-Quadratic Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Wang, Jiaheng
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

Simulating Gaussian boson sampling on graphs in polynomial time
par: Anand, Konrad, et autres
Publié: (2025)

An FPRAS for two terminal reliability in directed acyclic graphs
par: Feng, Weiming, et autres
Publié: (2023)

Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
par: Chen, Xiaoyu, et autres
Publié: (2024)

$(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
par: Mao, Xiao
Publié: (2023)

Approximating Maximum Matching Requires Almost Quadratic Time
par: Behnezhad, Soheil, et autres
Publié: (2024)

Approximate Butterfly Counting in Sublinear Time
par: Luo, Chi, et autres
Publié: (2026)

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

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
par: Eden, Talya, et autres
Publié: (2025)

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

Rapid mixing in positively weighted restricted Boltzmann machines
par: Feng, Weiming, et autres
Publié: (2026)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
par: Feng, Weiming, et autres
Publié: (2022)

Approximating Small Sparse Cuts
par: Anand, Aditya, et autres
Publié: (2024)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
par: Aumüller, Martin, et autres
Publié: (2024)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets
par: Liu, Yang P., et autres
Publié: (2025)

On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
par: Kopelowitz, Tsvi, et autres
Publié: (2023)

0-1 Knapsack in Nearly Quadratic Time
par: Jin, Ce
Publié: (2023)

A Nearly Quadratic-Time FPTAS for Knapsack
par: Chen, Lin, et autres
Publié: (2023)

Knapsack with Small Items in Near-Quadratic Time
par: Bringmann, Karl
Publié: (2023)

Deterministic counting from coupling independence
par: Chen, Xiaoyu, et autres
Publié: (2024)

Approximating the Total Variation Distance between Gaussians
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

The Complexity of Counting Small Sub-Hypergraphs
par: Bressan, Marco, et autres
Publié: (2025)

Parameterized Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Approximating the total variation distance between spin systems
par: Feng, Weiming, et autres
Publié: (2025)

Optimal FPT-Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2026)

Counting Distinct Square Substrings in Sublinear Time
par: Charalampopoulos, Panagiotis, et autres
Publié: (2025)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
par: Shahbazi, Nima, et autres
Publié: (2025)

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

Tight Streaming Lower Bounds for Deterministic Approximate Counting
par: Wang, Yichuan
Publié: (2024)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
par: Anand, Aditya, et autres
Publié: (2025)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
par: Hebert-Johnson, Ursula, et autres
Publié: (2023)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time Barrier
par: Bukov, Anton, et autres
Publié: (2023)

Approximating Partition in Near-Linear Time
par: Chen, Lin, et autres
Publié: (2024)

Weakly Approximating Knapsack in Subquadratic Time
par: Chen, Lin, et autres
Publié: (2025)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
par: Pensia, Ankit
Publié: (2024)

Scalable Algorithms for Approximate DNF Model Counting
par: Burkhardt, Paul, et autres
Publié: (2026)

On Sketching Quadratic Forms
par: Andoni, Alexandr, et autres
Publié: (2015)

Approximating Directed Connectivity in Almost-Linear Time
par: Quanrud, Kent
Publié: (2025)

Optimal Approximate Matrix Multiplication over Sliding Window
par: Xian, Haoming, et autres
Publié: (2025)