:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bund, Johannes, Lenzen, Christoph, Medina, Moti
Format:	Preprint
Publié:	2018
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	https://arxiv.org/abs/1811.12369
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Model-Agnostic Approximation of Constrained Forest Problems
par: Coupette, Corinna, et autres
Publié: (2024)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

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

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
par: Curticapean, Radu, et autres
Publié: (2025)

PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
par: Scheder, Dominik, et autres
Publié: (2025)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis
par: Curticapean, Radu, et autres
Publié: (2024)

Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
par: Wang, Chengu
Publié: (2026)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
par: Döring, Simon, et autres
Publié: (2024)

On Detecting $H$-Induced Minors for Small $H$
par: Eagling-Vose, Tala, et autres
Publié: (2026)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
par: Levet, Michael, et autres
Publié: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Enumerating models of DNF faster: breaking the dependency on the formula size
par: Capelli, Florent, et autres
Publié: (2018)

Colouring $(P_r+P_s)$-Free Graphs
par: Klimošová, Tereza, et autres
Publié: (2018)

Neighborhood-Aware Graph Labeling Problem
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Lazy Kronecker Product
par: Song, Zhao
Publié: (2026)

The Trichotomy of Regular Property Testing
par: Bathie, Gabriel, et autres
Publié: (2025)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

Can You Link Up With Treewidth?
par: Curticapean, Radu, et autres
Publié: (2024)

Downward self-reducibility in the total function polynomial hierarchy
par: Gajulapalli, Karthik, et autres
Publié: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
par: Fujie, Yuto, et autres
Publié: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
par: Moroie, Gregory
Publié: (2025)

Precoloring extension with demands on paths
par: Das, Arun Kumar, et autres
Publié: (2025)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
par: Gholizadeh, Hossein, et autres
Publié: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
par: Herrmann, Anton, et autres
Publié: (2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths
par: Assadi, Sepehr, et autres
Publié: (2025)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)

k-SUM Hardness Implies Treewidth-SETH
par: Lampis, Michael
Publié: (2025)

Efficient Catalytic Graph Algorithms
par: Cook, James, et autres
Publié: (2025)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
par: Enright, Jessica, et autres
Publié: (2020)

Minimizing Envy and Maximizing Happiness in Graphical House Allocation
par: Dhar, Anubhav, et autres
Publié: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)

Scheduling Problems with Constrained Rejections
par: Davies, Sami, et autres
Publié: (2025)

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
par: Uhlmann, Jeffrey
Publié: (2025)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
par: Ducoffe, Guillaume
Publié: (2026)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
par: Asadi, Vahid R., et autres
Publié: (2026)

Geometric Interpretation of 3-SAT and Phase Transition
par: Gillet, Frederic
Publié: (2025)