3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.CC2021
The Computational Complexity of Finding Arithmetic Expressions With and Without Parentheses
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…
math.NT2021★ 1 cited
Biases in Moments of the Dirichlet Coefficients in One- and Two-Parameter Families of Elliptic Curves
Steven J. Miller, Yan Weng
We study one-parameter families of elliptic curves over , which are of the form , with non-constant -invariant. We define the \textsuperscr…
math.NT2021★ 3 cited
Biases in Moments of Dirichlet Coefficients of Elliptic Curve Families
Steven Miller, Yan Weng
Elliptic curves arise in many important areas of modern number theory. One way to study them is take local data, the number of solutions modulo , and create an -function. The…