Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove that any oblivious algorithm using space S to find the median of a list of n integers fromf1;:::; 2ng requires time ( n log logSn). This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using onlys registers, each of which can store an input value orO(logn)-bit counter, that makes onlyO(log log s n) passes over the input. The bound also implies a size lor bound for read-once branching programs computing the low order bit of the median and implies the analog of P6 NP\ coNP for lengtho(n log logn) oblivious branching programs.
['Paul Beame', 'Vincent Liew', 'Mihai Pǎtraşcu']
I am writing a research paper on a idea Finding the Median (Obliviously) with Bounded Space
[{"from": "human", "value": "I am writing a research paper on a idea Finding the Median (Obliviously) with Bounded Space"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove that any oblivious algorithm using space S to find the median of a list of n integers fromf1;:::; 2ng requires time ( n log logSn). This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using onlys registers, each of which can store an input value orO(logn)-bit counter, that makes onlyO(log log s n) passes over the input. The bound also implies a size lor bound for read-once branching programs computing the low order bit of the median and implies the analog of P6 NP\\ coNP for lengtho(n log logn) oblivious branching programs."}]