Imagen de Portada

List Decoding Quotient Reed-Muller Codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gotlib, Omri, Kaufman, Tali, Lovett, Shachar
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
por: Kopparty, Swastik, et al.
Publicado: (2023)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
por: Braverman, Mark, et al.
Publicado: (2025)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
por: Armand, Jules, et al.
Publicado: (2025)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
por: Bhargav, C. S., et al.
Publicado: (2025)

Is Graph Local Complementation Inherently Sequential?
por: Concha-Vega, Pablo
Publicado: (2025)

How to Reconfigure Your Alliances
por: Fernau, Henning, et al.
Publicado: (2025)

Property Testing in Bounded Degree Hypergraphs
por: Aaronson, Hugo, et al.
Publicado: (2025)

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
por: Concha-Vega, Pablo, et al.
Publicado: (2025)

On the Incompressibility of Truth With Application to Circuit Complexity
por: Tonon, Luke
Publicado: (2025)

A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
por: Harary, Marc
Publicado: (2025)

On the complexity of freezing automata networks of bounded pathwidth
por: Goles, Eric, et al.
Publicado: (2025)

Enumeration With Nice Roman Domination Properties
por: Mann, Kevin
Publicado: (2025)

The PPP-completeness of the Ward-Szabo theorem
por: Ishizuka, Takashi
Publicado: (2025)

A Distance Amplification Lemma for Monotonicity
por: Minzer, Dor
Publicado: (2025)

Maximum Reachability Orientation of Mixed Graphs
por: Hörsch, Florian
Publicado: (2025)

Parameterized Complexity of Segment Routing
por: Bazgan, Cristina, et al.
Publicado: (2025)

On the enumeration of Tarski fixed points
por: Müller, Julian
Publicado: (2023)

Edge-Disjoint Paths in Eulerian Digraphs
por: Cavallaro, Dario, et al.
Publicado: (2024)

Relations between monotone complexity measures based on decision tree complexity
por: Byramji, Farzan, et al.
Publicado: (2024)

Gap Preserving Reductions Between Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2022)

Computational complexity of the Weisfeiler-Leman dimension
por: Lichter, Moritz, et al.
Publicado: (2024)

Gap Amplification for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2023)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
por: Marcille, Clara, et al.
Publicado: (2026)

Enumerating Minimal Defensive Alliances
por: Feng, Zhidan, et al.
Publicado: (2023)

Counting Subgraphs in Somewhere Dense Graphs
por: Bressan, Marco, et al.
Publicado: (2022)

Three Hardness Results for Graph Similarity Problems
por: Sun, He, et al.
Publicado: (2023)

Infinitely growing configurations in Emil Post's tag system problem
por: Kurilenko, Nikita V.
Publicado: (2021)

The Parameterized Complexity of Terminal Monitoring Set
por: Aravind, N. R., et al.
Publicado: (2024)

Maximal Line Digraphs
por: Japhet, Quentin, et al.
Publicado: (2024)

Inapproximability of the independent set polynomial in the complex plane
por: Bezakova, Ivona, et al.
Publicado: (2017)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
por: Carbonnel, Clément
Publicado: (2026)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
por: Rai, Ashutosh, et al.
Publicado: (2026)

Optimal Inapproximability of Promise Equations over Finite Groups
por: Butti, Silvia, et al.
Publicado: (2024)

Parallel Repetition for $3$-Player XOR Games
por: Bhangale, Amey, et al.
Publicado: (2024)

Complexity of Boolean automata networks under block-parallel update modes
por: Perrot, Kévin, et al.
Publicado: (2024)

On the equivalence of two post-quantum cryptographic families
por: Meneghetti, Alessio, et al.
Publicado: (2021)

Graphs without a partition into two proportionally dense subgraphs
por: Bazgan, Cristina, et al.
Publicado: (2018)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
por: Cohen, Gil, et al.
Publicado: (2025)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2025)

Factorization norms and an inverse theorem for MaxCut
por: Balla, Igor, et al.
Publicado: (2025)