Image de couverture de livre

Lower Bounds for Linear Operators

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ko, Young Kun
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity Discrete Mathematics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
par: Fei, Yumou, et autres
Publié: (2025)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2023)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
par: Lill, Jonas, et autres
Publié: (2024)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

$O(n +f(k))$: Truly Linear FPT
par: Bumpus, Benjamin Merlin, et autres
Publié: (2026)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
par: Chakraborty, Dipayan, et autres
Publié: (2024)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
par: Lucke, Felicia, et autres
Publié: (2023)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
par: Lucke, Felicia, et autres
Publié: (2024)

Relative-error unateness testing
par: Chen, Xi, et autres
Publié: (2025)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
par: Antoniadis, Antonios, et autres
Publié: (2025)

Relative-error testing of conjunctions and decision lists
par: Chen, Xi, et autres
Publié: (2025)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
par: Vroon, Mats, et autres
Publié: (2025)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
par: DeHaan, Ian, et autres
Publié: (2025)

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
par: Kutner, David C., et autres
Publié: (2025)

Second Price Matching with Complete Allocation and Degree Constraints
par: Pinchasi, Rom, et autres
Publié: (2025)

Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
par: Hirahara, Shuichi, et autres
Publié: (2025)

Boolean function monotonicity testing requires (almost) $n^{1/2}$ queries
par: Chen, Mark, et autres
Publié: (2025)

Testing Juntas and Junta Subclasses with Relative Error
par: Chen, Xi, et autres
Publié: (2025)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)

Parameterised distance to local irregularity
par: Fioravantes, Foivos, et autres
Publié: (2023)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
par: Shao, Shuai, et autres
Publié: (2023)

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
par: Hirahara, Shuichi, et autres
Publié: (2024)

On Approximate Reconfigurability of Label Cover
par: Ohsaka, Naoto
Publié: (2023)

Counting Locally Optimal Tours in the TSP
par: Manthey, Bodo, et autres
Publié: (2024)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
par: Hamm, Thekla, et autres
Publié: (2026)

Placing Green Bridges Optimally, with a Multivariate Analysis
par: Fluschnik, Till, et autres
Publié: (2021)

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

Relative-error monotonicity testing
par: Chen, Xi, et autres
Publié: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
par: Johnson, Matthew, et autres
Publié: (2022)

Breadth-First Search Trees with Many or Few Leaves
par: Beisegel, Jesse, et autres
Publié: (2026)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
par: Dumont, Joanne, et autres
Publié: (2026)

Maximum $k$- vs. $\ell$-colourings of graphs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2023)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
par: Hirahara, Shuichi, et autres
Publié: (2023)

The Days On Days Off Scheduling Problem
par: Nießen, Fabien, et autres
Publié: (2024)

The Complexity of Transitively Orienting Temporal Graphs
par: Mertzios, George B., et autres
Publié: (2021)

Channel allocation revisited through 1-extendability of graphs
par: Busson, Anthony, et autres
Publié: (2024)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
par: Conrado, Giovanna K., et autres
Publié: (2023)

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise
par: Ciardo, Lorenzo, et autres
Publié: (2023)