Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the computational por of decision lists over AND-functions versus threshold-○+ circuits. AND-decision lists are a natural generalization of formulas in disjunctive or conjunctive normal form.  show that, in contrast to CNF- and DNF-formulas, there are functions with small AND-decision lists which need exponential size unbounded ight threshold-○+ circuits. This implies that Jackson's polynomial learning algorithm for DNFs [7] which is based on the efficient simulation of DNFs by polynomial ight threshold-○+ circuits [8], cannot be applied to AND-decision lists. A further result is that for all k > 1 the complexity class defined by polynomial length AC 0  k -decision lists lies strictly beten AC 0  k+1  and AC 0  k+2 .
['Matthias Krause']
I am writing a research paper on a idea On the computational power of boolean decision lists
[{"from": "human", "value": "I am writing a research paper on a idea On the computational power of boolean decision lists"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the computational por of decision lists over AND-functions versus threshold-\u25cb+ circuits. AND-decision lists are a natural generalization of formulas in disjunctive or conjunctive normal form.  show that, in contrast to CNF- and DNF-formulas, there are functions with small AND-decision lists which need exponential size unbounded ight threshold-\u25cb+ circuits. This implies that Jackson's polynomial learning algorithm for DNFs [7] which is based on the efficient simulation of DNFs by polynomial ight threshold-\u25cb+ circuits [8], cannot be applied to AND-decision lists. A further result is that for all k > 1 the complexity class defined by polynomial length AC 0  k -decision lists lies strictly beten AC 0  k+1  and AC 0  k+2 ."}]