Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Gives an extension of the result due to Paul, Pippenger, Szemeredi and Trotter (1983) that deterministic linear time (DTIME) is distinct from nondeterministic linear time (NTIME).  show that NTIME[n/spl radic/log*(n)] /spl ne/ DTIME[n/spl radic/log*(n)].  show that if the class of multi-pushdown graphs has {o(n), o[n/log(n)]} segregators, then NTIME[n log(n)] /spl ne/ DTIME[n log(n)].  also show that at least one of the following facts holds: (1) P /spl ne/ L, and (2) for all polynomially bounded constructible time bounds t, NTIME(t) /spl ne/ DTIME(t).  consider the problem of whether NTIME(t) is distinct from NSPACE(t) for constructible time bounds t. A pebble game on graphs is defined such that the existence of a "good" strategy for the pebble game on multi-pushdown graphs implies a "good" simulation of nondeterministic time-bounded machines by nondeterministic space-bounded machines. It is shown that there exists a "good" strategy for the pebble game on multi-pushdown graphs if the graphs have sublinear separators. Finally,  show that nondeterministic time-bounded Turing machines can be simulated by /spl Sigma//sub 4/ machines with an asymptotically smaller time bound, under the assumption that the class of multi-pushdown graphs has sublinear separators.
['Rahul Santhanam']
I am writing a research paper on a idea On separators, segregators and time versus space
[{"from": "human", "value": "I am writing a research paper on a idea On separators, segregators and time versus space"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Gives an extension of the result due to Paul, Pippenger, Szemeredi and Trotter (1983) that deterministic linear time (DTIME) is distinct from nondeterministic linear time (NTIME).  show that NTIME[n/spl radic/log*(n)] /spl ne/ DTIME[n/spl radic/log*(n)].  show that if the class of multi-pushdown graphs has {o(n), o[n/log(n)]} segregators, then NTIME[n log(n)] /spl ne/ DTIME[n log(n)].  also show that at least one of the following facts holds: (1) P /spl ne/ L, and (2) for all polynomially bounded constructible time bounds t, NTIME(t) /spl ne/ DTIME(t).  consider the problem of whether NTIME(t) is distinct from NSPACE(t) for constructible time bounds t. A pebble game on graphs is defined such that the existence of a \"good\" strategy for the pebble game on multi-pushdown graphs implies a \"good\" simulation of nondeterministic time-bounded machines by nondeterministic space-bounded machines. It is shown that there exists a \"good\" strategy for the pebble game on multi-pushdown graphs if the graphs have sublinear separators. Finally,  show that nondeterministic time-bounded Turing machines can be simulated by /spl Sigma//sub 4/ machines with an asymptotically smaller time bound, under the assumption that the class of multi-pushdown graphs has sublinear separators."}]