In this chapter we show a time-size tradeoff for nondeterministic branching programs. By the
of a program in this chapter we will mean the number of nodes, not just the number of labeled edges. A program computes a given function
T if every accepted input has at least one accepting computation of length at most T.