Abstract
A wide variety of problems in discrete mathematics, computer science, or the design of integrated circuits involve the task of manipulating objects over finite domains. The dependencies and relations among the objects are modeled by means of discrete functions. By introducing a binary encoding for the elements of the underlying domain, each finite problem can be fully expressed by means of switching functions, i.e., functions mapping bit vectors to single bits. Consequently, manipulations over finite domains can be entirely reduced to the treatment of switching functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meinel, C., Theobald, T. (1998). Introduction. In: Algorithms and Data Structures in VLSI Design. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58940-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-58940-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64486-6
Online ISBN: 978-3-642-58940-9
eBook Packages: Springer Book Archive