Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
type: Item
instance of: scholarly article
title: Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
arXiv ID: 2010.08576
DOI: 10.1145/3406325.3451024
author: Jesper Nederlof
author: Karol Węgrzycki
published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
publication date: 2023-11-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/2010.08576
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7765278
zbMATH Keywords: knapsack
zbMATH Keywords: meet-in-the-middle
zbMATH Keywords: representation technique
zbMATH Keywords: space complexity
zbMATH Keywords: subset sum
MaRDI profile type: Publication
Wikidata QID: Q112313929
OpenAlex ID: W3172442290
Recommended article: Q4203809
Recommended article: Q4370212
Recommended article: On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
Recommended article: Improved low-density subset sum algorithms
Recommended article: An Improved Low-Density Subset Sum Algorithm
Recommended article: Efficient Randomized Algorithm for a Vector Subset Problem
Recommended article: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Recommended article: Q4219034
Recommended article: An approximation scheme for a problem of search for a vector subset
Recommended article: A Faster Pseudopolynomial Time Algorithm for Subset Sum
description: scientific article; zbMATH DE number 7765278