scientific article; zbMATH DE number 7651168
From MaRDI portal
Publication:5874497
Cites work
- scientific article; zbMATH DE number 5899282 (Why is no real title available?)
- scientific article; zbMATH DE number 1256679 (Why is no real title available?)
- scientific article; zbMATH DE number 7561512 (Why is no real title available?)
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- scientific article; zbMATH DE number 7650401 (Why is no real title available?)
- A faster pseudopolynomial time algorithm for subset sum
- A near-linear pseudopolynomial time algorithm for subset sum
- Computing dominances in \(E^ n\)
- Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
- Fast algorithms for knapsack via convolution and prediction
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Faster all-pairs shortest paths via circuit complexity
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- On a linear diophantine problem of Frobenius
- On integer programming and convolution
- On problems equivalent to \((\min,+)\)-convolution
- Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius
- The Change-Making Problem
Cited in
(3)
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 Q5874497)
