:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Bogdanov, Andrej, Rosen, Alon, Vafa, Neekon, Vaikuntanathan, Vinod
Formato:	Preprint
Publicado:	2025
Materias:	Computation Computational Complexity Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2504.09331
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Symmetric Perceptrons, Number Partitioning and Lattices
por: Vafa, Neekon, et al.
Publicado: (2025)

The Planted Orthogonal Vectors Problem
por: Kühnemann, David, et al.
Publicado: (2025)

Average-Case Complexity of Quantum Stabilizer Decoding
por: Khesin, Andrey Boris, et al.
Publicado: (2025)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Graph Property Certification
por: Das, Avinandan, et al.
Publicado: (2025)

On the Advantage of Adaptivity for Sampling with Cell Probes
por: Byramji, Farzan, et al.
Publicado: (2026)

On the complexity of global Roman domination problem in graphs
por: Reddy, Sangam Balchandar, et al.
Publicado: (2026)

Oblivious Defense in ML Models: Backdoor Removal without Detection
por: Goldwasser, Shafi, et al.
Publicado: (2024)

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
por: Grandjean, Étienne, et al.
Publicado: (2025)

A computational phase transition for learning-to-sample from Ising models
por: Risteski, Andrej, et al.
Publicado: (2026)

Adaptive and oblivious statistical adversaries are equivalent
por: Blanc, Guy, et al.
Publicado: (2024)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
por: Greilhuber, Jakob, et al.
Publicado: (2025)

The Trichotomy of Regular Property Testing
por: Bathie, Gabriel, et al.
Publicado: (2025)

Downward self-reducibility in the total function polynomial hierarchy
por: Gajulapalli, Karthik, et al.
Publicado: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
por: Fujie, Yuto, et al.
Publicado: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
por: Moroie, Gregory
Publicado: (2025)

Precoloring extension with demands on paths
por: Das, Arun Kumar, et al.
Publicado: (2025)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
por: Gholizadeh, Hossein, et al.
Publicado: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths
por: Assadi, Sepehr, et al.
Publicado: (2025)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
por: Maalouly, Nicolas El, et al.
Publicado: (2025)

k-SUM Hardness Implies Treewidth-SETH
por: Lampis, Michael
Publicado: (2025)

Efficient Catalytic Graph Algorithms
por: Cook, James, et al.
Publicado: (2025)

Minimizing Envy and Maximizing Happiness in Graphical House Allocation
por: Dhar, Anubhav, et al.
Publicado: (2025)

Scheduling Problems with Constrained Rejections
por: Davies, Sami, et al.
Publicado: (2025)

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
por: Uhlmann, Jeffrey
Publicado: (2025)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

Geometric Interpretation of 3-SAT and Phase Transition
por: Gillet, Frederic
Publicado: (2025)

PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
por: Scheder, Dominik, et al.
Publicado: (2025)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
por: Curticapean, Radu, et al.
Publicado: (2025)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

Most Juntas Saturate the Hardcore Lemma
por: Kumar, Vinayak M.
Publicado: (2025)

FPT Parameterisations of Fractional and Generalised Hypertree Width
por: Lanzinger, Matthias, et al.
Publicado: (2025)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
por: Kluk, Kacper, et al.
Publicado: (2025)

Novel Complexity Results for Temporal Separators with Deadlines
por: Dondi, Riccardo, et al.
Publicado: (2025)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
por: Kurita, Kazuhiro, et al.
Publicado: (2025)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
por: Björklund, Andreas, et al.
Publicado: (2025)

Broadcasting under Structural Restrictions
por: Egami, Yudai, et al.
Publicado: (2025)

Randomized $\tilde{O}(m\sqrt{n})$ Bellman-Ford from Fineman and the Boilermakers
por: Rao, Satish
Publicado: (2025)