First Page | Document Content | |
---|---|---|
Date: 2005-06-06 10:13:30Meromorphic functions Polynomials Rational function Interpolation Characteristic polynomial Computational complexity theory Fundamental theorem of algebra Algebra Mathematics Abstract algebra | Set Reconciliation with Nearly Optimal Communication Complexity∗ Yaron Minsky,†Ari Trachtenberg,‡and Richard Zippel§ April 29, 2004 AbstractAdd to Reading ListSource URL: ipsit.bu.eduDownload Document from Source WebsiteFile Size: 173,24 KBShare Document on Facebook |