Differences between revisions 1 and 2
Revision 1 as of 2007-02-14 04:38:31
Size: 137
Editor: anonymous
Comment:
Revision 2 as of 2007-02-14 05:47:41
Size: 616
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 4: Line 4:


Skip to page 13. I've already implemented:

 * Direct computation (option 1 in the paper)
 * Input partitioning (option 2)
 * Most of input clumping (option 3)

I need:
 * Output partitioning
 * Output clumping
 * Some insight as to why DJB thinks that one can "quickly compute the parameter sequence given ''p, q''. I'll bring a print copy of the 3 papers by Pippenger.
 * The general case (not certain this is a reasonable goal for the amount of time we have)

Tom Boothby: Implement Pippenger's Algorithm for multivariate polynomial evaluation

[http://cr.yp.to/papers/pippenger.pdf Paper]

Skip to page 13. I've already implemented:

  • Direct computation (option 1 in the paper)
  • Input partitioning (option 2)
  • Most of input clumping (option 3)

I need:

  • Output partitioning
  • Output clumping
  • Some insight as to why DJB thinks that one can "quickly compute the parameter sequence given p, q. I'll bring a print copy of the 3 papers by Pippenger.

  • The general case (not certain this is a reasonable goal for the amount of time we have)

days3/sprints/pippenger (last edited 2008-11-14 13:41:56 by anonymous)