Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  contribute to the program of proving lor bounds on the size of branching programs solving the Tree Evaluation Problem introduced in (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012). Proving an exponential lor bound for the size of the non-deterministic thrifty branching programs would separate NL from P under the thrifty hypothesis. In this context,  consider a restriction of non-deterministic thrifty branching programs called bitwise-independence.  show that any bitwise-independent non-deterministic thrifty branching program solving BT_2(h,k) must have at least 1/2 k^{h/2} states. Prior to this work, lor bounds re known for general branching programs only for fixed heights h=2,3,4 (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012). Our lor bounds are also tight (up to a factor of k), since the known (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012) non-deterministic thrifty branching programs for this problem of size O(k^{h/2+1}) are bitwise-independent.  prove our results by associating a fractional pebbling strategy with any bitwise-independent non-deterministic thrifty branching program solving the Tree Evaluation Problem. Such a connection was not known previously even for fixed heights.#R##N##R##N#Our main technique is the entropy method introduced by Jukna and Zak (S. Jukna and S. Žak, 2003) originally in the context of proving lor bounds for read-once branching programs.  also show that the previous lor bounds known (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012) for deterministic branching programs for Tree Evaluation Problem can be obtained using this approach. Using this method,  also show tight lor bounds for any k-way deterministic branching program solving Tree Evaluation Problem when the instances are restricted to have the same group operation in all internal nodes.
['Balagopal Komarath', 'Jayalal Sarma']
I am writing a research paper on a idea Pebbling, Entropy and Branching Program Size Lower Bounds
[{"from": "human", "value": "I am writing a research paper on a idea Pebbling, Entropy and Branching Program Size Lower Bounds"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  contribute to the program of proving lor bounds on the size of branching programs solving the Tree Evaluation Problem introduced in (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012). Proving an exponential lor bound for the size of the non-deterministic thrifty branching programs would separate NL from P under the thrifty hypothesis. In this context,  consider a restriction of non-deterministic thrifty branching programs called bitwise-independence.  show that any bitwise-independent non-deterministic thrifty branching program solving BT_2(h,k) must have at least 1/2 k^{h/2} states. Prior to this work, lor bounds re known for general branching programs only for fixed heights h=2,3,4 (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012). Our lor bounds are also tight (up to a factor of k), since the known (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012) non-deterministic thrifty branching programs for this problem of size O(k^{h/2+1}) are bitwise-independent.  prove our results by associating a fractional pebbling strategy with any bitwise-independent non-deterministic thrifty branching program solving the Tree Evaluation Problem. Such a connection was not known previously even for fixed heights.#R##N##R##N#Our main technique is the entropy method introduced by Jukna and Zak (S. Jukna and S. \u017dak, 2003) originally in the context of proving lor bounds for read-once branching programs.  also show that the previous lor bounds known (Stephen A. Cook, Pierre McKenzie, Dustin hr, Mark Braverman, and Rahul Santhanam, 2012) for deterministic branching programs for Tree Evaluation Problem can be obtained using this approach. Using this method,  also show tight lor bounds for any k-way deterministic branching program solving Tree Evaluation Problem when the instances are restricted to have the same group operation in all internal nodes."}]