Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Proving superpolylogarithmic lor bounds for dynamic data structures has remained an open problem despite years of research. Pǎtrascu proposed an exciting approach for breaking this barrier via a two-player communication model in which one player gets private advice at the beginning of the protocol. He gave reductions from the problem of solving an asymmetric version of set-disjointness in his model to a diverse collection of natural dynamic data structure problems in the cell probe model. He also conjectured that, for any hard problem in the standard two-party communication model, the asymmetric version of the problem is hard in his model, provided not too much advice is given. ,  prove several surprising results about his model.  show that there exist Boolean functions requiring linear randomized communication complexity in the two-party model, for which the asymmetric versions in his model have deterministic protocols with exponentially smaller complexity. For set-disjointness, which ...
['Arkadev Chattopadhyay', 'Jeff Edmonds', 'Faith Ellen', 'Toniann Pitassi']
I am writing a research paper on a idea Upper and Lower Bounds on the Power of Advice
[{"from": "human", "value": "I am writing a research paper on a idea Upper and Lower Bounds on the Power of Advice"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Proving superpolylogarithmic lor bounds for dynamic data structures has remained an open problem despite years of research. P\u01cetrascu proposed an exciting approach for breaking this barrier via a two-player communication model in which one player gets private advice at the beginning of the protocol. He gave reductions from the problem of solving an asymmetric version of set-disjointness in his model to a diverse collection of natural dynamic data structure problems in the cell probe model. He also conjectured that, for any hard problem in the standard two-party communication model, the asymmetric version of the problem is hard in his model, provided not too much advice is given. ,  prove several surprising results about his model.  show that there exist Boolean functions requiring linear randomized communication complexity in the two-party model, for which the asymmetric versions in his model have deterministic protocols with exponentially smaller complexity. For set-disjointness, which ..."}]