Pages that link to "Item:Q1382248"
From MaRDI portal
The following pages link to On variations of the subset sum problem (Q1382248):
Displaying 17 items.
- A short note on Merlin-Arthur protocols for subset sum (Q344519) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- New analytical results in subset-sum problem (Q685677) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Subset-sum problems with different summands: Computation (Q922292) (← links)
- Subset sum problems with special digraph constraints (Q2050272) (← links)
- Counting the decimation classes of binary vectors with relatively prime length and density (Q2114775) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- Weighted proper orientations of trees and graphs of bounded treewidth (Q2632010) (← links)
- Dynamic programming for the subset sum problem (Q2658814) (← links)
- (Q3415011) (← links)
- Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (Q3557805) (← links)
- NP-completeness for calculating power indices of weighted majority games (Q5941522) (← links)
- On the complexity of computing Gröbner bases for weighted homogeneous systems (Q5963397) (← links)
- Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
- (Q6039834) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)