Abstract
A number of computational problems considered thus far have algorithms that make no use of multiplication or division. This is the case for the Knapsack or Traveling Salesman problems.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blum, L., Cucker, F., Shub, M., Smale, S. (1998). Additive Machines. In: Complexity and Real Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0701-6_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0701-6_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6873-4
Online ISBN: 978-1-4612-0701-6
eBook Packages: Springer Book Archive