Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I read your arxiv paper yesterday (or was it the day before).

Do you think this can be used to speed up the algebraic method for k-path?

If so, you should enter next years PACE challenge.

 help



I'm not sure, since we only do univariate polynomials and k-path has lots of variables, right?

But maybe this work can inspire looking for other small, constant factor saving circuits for different classes of polynomials. Would be cool!

reply




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: