Consumer Optimization Problem Solving by Alfred L. Norman [Hardback, 252 pages]
97,44 €
What algorithms are tractable depends on the speed of the processor. Given the speed of digital computers, polynomial algorithms are considered tractable. But, a human can take several seconds to make one binary comparison between two pens.
Jetzt bei Ebay: