Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let x i ,...,x k  be n-bit numbers and T ∈ N. Assume that P 1 ,..., P k  are players such that P, knows all of the numbers except x i . They want to determine if Σ k  i=1  x j  = T by broadcasting as few bits as possible. In [7] an upper bound of O(√n) bits was obtained for the k = 3 case, and a lor bound of ω(1) for k > 3 when T = Θ(2 n ).  obtain (1) for k ≥ 3 an upper bound of k + O((n + logk) 1/([lg(2k-2)]) , (2) for k = 3, T = Θ(2 n ), a lor bound of Ω(log log n), (3) a generalization of the protocol to abelian groups, (4) lor bounds on the multiparty communication complexity of some regular languages, and (5) empirical results for k = 3.
['Richard Beigel', 'William I. Gasarch', 'James Glenn']
I am writing a research paper on a idea The multiparty communication complexity of exact-T : Improved bounds and new problems
[{"from": "human", "value": "I am writing a research paper on a idea The multiparty communication complexity of exact-T : Improved bounds and new problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let x i ,...,x k  be n-bit numbers and T \u2208 N. Assume that P 1 ,..., P k  are players such that P, knows all of the numbers except x i . They want to determine if \u03a3 k  i=1  x j  = T by broadcasting as few bits as possible. In [7] an upper bound of O(\u221an) bits was obtained for the k = 3 case, and a lor bound of \u03c9(1) for k > 3 when T = \u0398(2 n ).  obtain (1) for k \u2265 3 an upper bound of k + O((n + logk) 1/([lg(2k-2)]) , (2) for k = 3, T = \u0398(2 n ), a lor bound of \u03a9(log log n), (3) a generalization of the protocol to abelian groups, (4) lor bounds on the multiparty communication complexity of some regular languages, and (5) empirical results for k = 3."}]