Algorithmus und Designkomplexität von Sherine, Anli [gebunden]
121,01 €
Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. It further includes algorithms that are definite and effective, known as computational procedures.
Jetzt bei Ebay:
![Produktbild - Algorithm and Design Complexity by Sherine, Anli [Paperback]](https://i.ebayimg.com/thumbs/images/g/awQAAeSwOL5oRFVO/s-l140.jpg)
![Produktbild - Fragments of First-Order Logic (Oxford Logic Guides) [Hardback]](https://i.ebayimg.com/thumbs/images/g/1w0AAeSw~Bpn1Gm3/s-l140.jpg)
![Produktbild - Pearls of Algorithm Engineering by Ferragina, Paolo [Hardback]](https://i.ebayimg.com/thumbs/images/g/IWgAAeSw27NoTA1J/s-l140.jpg)
![Produktbild - The Real Sinéad O'Connor by Ariane Sherine [Hardback]](https://i.ebayimg.com/thumbs/images/g/wfQAAeSw7eJoSD4S/s-l140.jpg)
![Produktbild - Algorithms, Collusion and Competition Law: A Comparative Approach [Hardback]](https://i.ebayimg.com/thumbs/images/g/N8oAAeSw29doHhrO/s-l140.jpg)