"Using an information-theoretic approach we prove a lower bound for so-called 'balanced' branching programs which for some classes of Boolean functions are more powerful than the most of previously considered restricted branching programs. The argument of the proof is based on an inequality for the average amount of uncertainty during the computation." . "Neuveden" . "[FD98585CE21C]" . . . "On Uncertainty versus Size in Branching Programs." . . "P(GA201/98/0717)" . . "RIV/67985807:_____/01:06010201!RIV/2002/GA0/A06002/N" . "On Uncertainty versus Size in Branching Programs."@en . . . "\u017D\u00E1k, Stanislav" . "On Uncertainty versus Size in Branching Programs." . . . . . "0"^^ . "2001-01-01+01:00"^^ . "2"^^ . "0"^^ . "X1-X5" . . "1"^^ . "Using an information-theoretic approach we prove a lower bound for so-called 'balanced' branching programs which for some classes of Boolean functions are more powerful than the most of previously considered restricted branching programs. The argument of the proof is based on an inequality for the average amount of uncertainty during the computation."@en . "On Uncertainty versus Size in Branching Programs." . . "Trier" . "5"^^ . . "N/A"@en . "Jukna, S." . "RIV/67985807:_____/01:06010201" . "690054" . "On Uncertainty versus Size in Branching Programs."@en . "N/A" . .