search result

Cover von Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution

Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution

Year: 2023
Media group: LIPIcs
Cover von Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution

Year: 2022
Media group: LIPIcs
Cover von Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal

Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal

Year: 2021
Media group: LIPIcs
Cover von A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence

A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence

Year: 2021
Media group: LIPIcs
Cover von Fine-Grained Complexity Theory

Fine-Grained Complexity Theory

Year: 2019
Media group: LIPIcs
Cover von Brief Announcement

Brief Announcement

A Note on Hardness of Diameter Approximation
Year: 2017
Media group: LIPIcs
Cover von Fast n-Fold Boolean Convolution via Additive Combinatorics

Fast n-Fold Boolean Convolution via Additive Combinatorics

Year: 2021
Media group: LIPIcs
Cover von Translating Hausdorff Is Hard

Translating Hausdorff Is Hard

Fine-Grained Lower Bounds for Hausdorff Distance Under Translation
Year: 2021
Media group: LIPIcs
Cover von Polyline Simplification has Cubic Complexity

Polyline Simplification has Cubic Complexity

Year: 2019
Media group: LIPIcs
Cover von Multivariate Analysis of Orthogonal Range Searching and Graph Distances

Multivariate Analysis of Orthogonal Range Searching and Graph Distances

Year: 2019
Media group: LIPIcs
OPEN V 11.1.0.0