The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We compare the complexities of Boolean functions for nondeterministic syntactic read-k-times branching and branching read-s k -times programs. It is shown that for each natural number k, k>=2, there exists a sequence of Boolean functions such that the complexity of computation of each function of this sequence by nondeterministic syntactic branching read-k-times programs is exponentially...