𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower Bounds on the Multiparty Communication Complexity

✍ Scribed by Pavol Ďuriš; José D.P. Rolim

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
236 KB
Volume
56
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Lower Bounds for the Complexity of
Some Lower Bounds for the Complexity of Continuation Methods
✍ Jean-Pierre Dedieu; Steve Smale 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 222 KB

In this note we consider the zero-finding problem for a homogeneous polynomial system, The well-determined (m=n) and underdetermined (m<n) cases are considered together. We also let D=max d i , d=(d 1 , ..., d m ), and The projective Newton method has been introduced by Shub in [6] and is defined

Upper and lower bounds for the average-c
Upper and lower bounds for the average-case complexity of path-search
✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent

Lower Bounds for the Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
✍ Nader H. Bshouty 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Ä 4 operations q, y, = , the standard bit operation Shift, Ro

Improved Bounds on the Sample Complexity
Improved Bounds on the Sample Complexity of Learning
✍ Yi Li; Philip M. Long; Aravind Srinivasan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is wit