Image de couverture de livre

Polynomial Property Testing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gishboliner, Lior, Shapira, Asaf
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Testing versus estimation of graph properties, revisited
par: Asaf Shapira, et autres
Publié: (2024)

A Fast Coloring Oracle for Average Case Hypergraphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

An algorithmic Polynomial Freiman-Ruzsa theorem
par: Castro-Silva, Davi, et autres
Publié: (2026)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
par: Bell, Tolson, et autres
Publié: (2023)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Sampling Balanced Forests of Grids in Polynomial Time
par: Cannon, Sarah, et autres
Publié: (2023)

On Matrices over a Polynomial Ring with Restricted Subdeterminants
par: Celaya, Marcel, et autres
Publié: (2023)

Hypergraph removal with polynomial bounds
par: Gishboliner, Lior, et autres
Publié: (2022)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
par: Bourneuf, Romain, et autres
Publié: (2025)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
par: Galby, Esther, et autres
Publié: (2023)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
par: Leake, Jonathan, et autres
Publié: (2025)

Testing Sumsets is Hard
par: Chen, Xi, et autres
Publié: (2024)

Polynomial-time sampling despite disorder chaos
par: Ma, Eric, et autres
Publié: (2025)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
par: Leake, Jonathan, et autres
Publié: (2025)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
par: Jones, Mark, et autres
Publié: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

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

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

Optimal Bounds for Open Addressing Without Reordering
par: Farach-Colton, Martin, et autres
Publié: (2025)

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
par: Gharan, Shayan Oveis, et autres
Publié: (2025)

Connected Partitions via Connected Dominating Sets
par: Niklanovits, Aikaterini, et autres
Publié: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, et autres
Publié: (2025)

A Combinatorial Characterization of Constant Mixing Time
par: Lau, Lap Chi, et autres
Publié: (2025)

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

Cutwidth and Crossings
par: Rauch, Johannes, et autres
Publié: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Faithful universal graphs for minor-closed classes
par: Bastide, Paul, et autres
Publié: (2025)

Short circuit walks in fixed dimension
par: Black, Alexander E., et autres
Publié: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
par: Xiao, Hanyin, et autres
Publié: (2025)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

Lower bounds on collective additive spanners
par: Corneil, Derek G., et autres
Publié: (2025)

Sparsifying Cayley Graphs on Every Group
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
par: Kuszmaul, William, et autres
Publié: (2025)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
par: Kuszmaul, William
Publié: (2025)