Keywords
- Computational Time
- Boolean Function
- Order Relation
- Systematic Presentation
- Transportation Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRights and permissions
Copyright information
© 1965 Springer-Verlag
About this chapter
Cite this chapter
Ivănescu, P.L. (1965). Applications to switching algebra. In: Pseudo-Boolean Programming and Applications. Lecture Notes in Mathematics, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073948
Download citation
DOI: https://doi.org/10.1007/BFb0073948
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-03352-3
Online ISBN: 978-3-540-37136-6
eBook Packages: Springer Book Archive
