3 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Jayson Lynch, Yan, Weng
We show NP-completeness for various problems about the existence of arithmetic expression trees. When given a set of operations, inputs, and a target value does there exist an expr…