To be able to work with concrete switching functions, a description of these functions is required. Of course, there is a very broad spectrum of possible description types. Basically, the representation has to describe the function adequately and thoroughly, i.e., it must be completely clear from the representation which switching function is considered. Besides this fundamental condition, which has always to be satisfied, a series of further properties are desirable. For example, the description of a function should
and much more.
be rather short and efficient
support the evaluation and manipulation of the function
make particular properties of the function visible
suggest ideas for a technical realization
Unable to display preview. Download preview PDF.
- Concerning the historic works of Lee,Masek,and Cobham, the references are[Lee59,Mas76,Cob66]Google Scholar
- More material on the mentioned classical representations of switching functions can be found in, e.g., [Weg87, Mei89]. Reference [Mor92] contains a survey on decision trees.Google Scholar
- The complexity results for the different classes of branching programs go back to Gergov and Meinel [GM94b].Google Scholar
© Springer-Verlag Berlin Heidelberg 1998