scientific article; zbMATH DE number 7204473
From MaRDI portal
Publication:5111351
DOI10.4230/LIPICS.ICALP.2017.21zbMATH Open1441.68078arXiv1703.00941MaRDI QIDQ5111351FDOQ5111351
Authors: Marvin Künnemann, Ramamohan Paturi, Stefan Schneider 
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1703.00941
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (21)
- Tight conditional lower bounds for longest common increasing subsequence
- Tight conditional lower bounds for longest common increasing subsequence
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.
- The Least Weight Subsequence Problem
- Faster minimization of tardy processing time on a single machine
- (1+1) EA on Generalized Dynamic OneMax
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Computing generalized convolutions faster than brute force
- Hamming Distance Completeness
- A polyhedral perspective on tropical convolutions
- On problems equivalent to \((\min,+)\)-convolution
- Title not available (Why is that?)
- More on change-making and related problems
- Quantum complexity for vector domination problem
- Fine-Grained Complexity Theory (Tutorial)
- Title not available (Why is that?)
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- The fine-grained complexity of multi-dimensional ordering properties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111351)
