Fast Multipoint Evaluation of Bivariate Polynomials: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:3415:34, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,732 bytes +1,732‎ Created page with "Title: Fast Multipoint Evaluation of Bivariate Polynomials Abstract: This research focuses on the efficient evaluation of bivariate polynomials at multiple points. The authors propose an algorithm that can evaluate a polynomial of degree n at n2generic points within an average time cost of O(n0.91), which is significantly faster than the sequential evaluation method that requires O(n2) operations. This algorithm is based on the Fast Fourier Transform and fast polynomial..."
Retrieved from "https://simplesci.org/wiki/Fast_Multipoint_Evaluation_of_Bivariate_Polynomials"