most citedFrequency-domain MLPs are More Effective Learners in Time Series Forecasting

94 citations · 94 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2022

Undecidability of polynomial inequalities in weighted graph homomorphism densities

Grigoriy Blekherman, Annie Raymond, Fan Wei

Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights. Using th…