The following pages link to On the equal-subset-sum problem (Q1198083):
Displaying 33 items.
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Decision problems for some classes of integer partitions and number multisets (Q389094) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- Covering a set with arithmetic progressions is NP-complete (Q910219) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- On the hardness of finding subsets with equal average (Q2444739) (← links)
- Simple FPTAS for the subset-sums ratio problem (Q2445243) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
- Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2971140) (← links)
- Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2988836) (← links)
- The $k$ -Equal Problem (Q4660553) (← links)
- (Q5021247) (← links)
- (Q5075820) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM (Q5150749) (← links)
- Fundamentals of Computation Theory (Q5900789) (← links)
- Fair draws for group rounds in sport tournaments (Q6070973) (← links)
- One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
- Approximating subset sum ratio via partition computations (Q6541032) (← links)
