Abstract
The Cartesian product of two sets is the set of all pairs of elements such that the first element of the pair is in one input set and the second element is in the other input set. We discuss derivations of algorithms to find Cartesian set products from Manna and Waldinger [42] and from Smith [53].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Steier, D.M., Anderson, A.P. (1989). Cartesian Set Product. In: Algorithm Synthesis: A Comparative Study. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8877-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8877-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96960-2
Online ISBN: 978-1-4613-8877-7
eBook Packages: Springer Book Archive