Copertina

An algorithmic Polynomial Freiman-Ruzsa theorem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Castro-Silva, Davi, Briët, Jop, Arunachalam, Srinivasan, Dutt, Arkopal, Gur, Tom
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Combinatorics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Algorithmic Polynomial Freiman-Ruzsa Theorems
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2025)

Polynomial-time tolerant testing stabilizer states
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2024)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
di: Bedert, Benjamin, et al.
Pubblicazione: (2025)

A note on polynomial-time tolerant testing stabilizer states
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2024)

Testing and learning structured quantum Hamiltonians
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2024)

A note on Ordered Ruzsa-Szemerédi graphs
di: Pratt, Kevin
Pubblicazione: (2025)

Learning low-degree quantum objects
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2024)

Polynomial Property Testing
di: Gishboliner, Lior, et al.
Pubblicazione: (2025)

Clifford testing: algorithms and lower bounds
di: Hinsche, Marcel, et al.
Pubblicazione: (2025)

A near-optimal Quadratic Goldreich-Levin algorithm
di: Briët, Jop, et al.
Pubblicazione: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
di: Davot, Tom, et al.
Pubblicazione: (2025)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2023)

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
di: Bell, Tolson, et al.
Pubblicazione: (2023)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

A faster algorithm for Vertex Cover parameterized by solution size
di: Harris, David G., et al.
Pubblicazione: (2022)

On the threshold for Szemerédi's theorem with random differences
di: Briët, Jop, et al.
Pubblicazione: (2023)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
di: Biedl, Therese
Pubblicazione: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
di: Daga, Mohit
Pubblicazione: (2025)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
di: Xiao, Hanyin, et al.
Pubblicazione: (2025)

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
di: Leung, Yui Hin Arvin
Pubblicazione: (2025)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
di: Srinivasan, Eshwar, et al.
Pubblicazione: (2026)

Sampling Balanced Forests of Grids in Polynomial Time
di: Cannon, Sarah, et al.
Pubblicazione: (2023)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
di: Behnezhad, Soheil, et al.
Pubblicazione: (2024)

On Matrices over a Polynomial Ring with Restricted Subdeterminants
di: Celaya, Marcel, et al.
Pubblicazione: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)

Making an oriented graph acyclic using inversions of bounded or prescribed size
di: Bang-Jensen, Jørgen, et al.
Pubblicazione: (2025)

Learning stabilizer structure of quantum states
di: Arunachalam, Srinivasan, et al.
Pubblicazione: (2025)

Dvorak-Dell-Grohe-Rattan theorem via an asymptotic argument
di: Kozachinskiy, Alexander
Pubblicazione: (2025)

Efficient algorithms for the Potts model on small-set expanders
di: Carlson, Charles, et al.
Pubblicazione: (2020)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
di: Guo, Zeyu, et al.
Pubblicazione: (2023)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
di: Galby, Esther, et al.
Pubblicazione: (2023)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
di: Deák, Bence, et al.
Pubblicazione: (2026)

Generalising the maximum independent set algorithm via Boolean networks
di: Gadouleau, Maximilien, et al.
Pubblicazione: (2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
di: Alecu, Bogdan, et al.
Pubblicazione: (2024)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
di: Leake, Jonathan, et al.
Pubblicazione: (2025)

Polynomial-time sampling despite disorder chaos
di: Ma, Eric, et al.
Pubblicazione: (2025)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
di: Korhonen, Tuukka, et al.
Pubblicazione: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
di: Bernshteyn, Anton, et al.
Pubblicazione: (2024)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
di: Leake, Jonathan, et al.
Pubblicazione: (2025)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
di: Assadi, Sepehr, et al.
Pubblicazione: (2024)