Algorithm design complexity theoretical di fernandes flávia (2 risultati)

Autore
Titolo
Perfeziona con la Ricerca avanzata

Perfeziona la tua ricerca

  • Libri (2)

  • Nuovo (2)

a

Fascia di prezzo personalizzata (EUR)

a

    • Lingua: Inglese

      Editore: Our Knowledge Publishing, 2025

      6209143016 / 9786209143014

      • Brossura

      Da: preigu, Osnabrück, Germaniapreigu

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 39,45

      EUR 70,00 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 5 disponibili

      Taschenbuch. Condizione: Neu. Algorithm Design and Complexity | A Theoretical and Practical Approach | Flávia Gonçalves Fernandes | Taschenbuch | Englisch | 2025 | Our Knowledge Publishing | EAN 9786209143014 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.

    • Lingua: Inglese

      Editore: Our Knowledge Publishing, 2025

      6209143016 / 9786209143014

      • Brossura
      • Print on Demand

      Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

      Venditore con 5 stelle
      Contatta il venditore

      Condizione: Nuovo

      EUR 46,08

      EUR 30,50 spedizione 
      Spedito da Germania a U.S.A.

      Quantità: 1 disponibili

      Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The book Algorithm Design and Complexity: A Theoretical and Practical Approach offers a comprehensive exploration of the fundamental principles and advanced techniques involved in constructing and analyzing efficient algorithms. Combining theoretical rigor and practical application, the book covers classic design strategies such as divide and conquer, dynamic programming, greedy algorithms, backtracking and probabilistic algorithms, as well as discussing computational limits, complexity classes and intractable problems.Aimed at students, teachers and professionals in the field of computer science, the book presents content structured in a didactic way, accompanied by examples, pseudocode and exercises that promote the development of algorithmic reasoning. The analysis of time and space complexity is dealt with in depth, enabling the reader to evaluate the efficiency and scalability of their solutions.By integrating theory and practice, this book establishes itself as an essential guide for anyone seeking to understand the fundamentals that underpin computational performance and to design robust, optimized algorithms that are applicable to the most diverse contexts of contemporary computing.