No label defined (Q3741041)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3976318
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3976318

      Statements

      1985
      0 references
      graph algorithms
      0 references
      efficient algorithms
      0 references
      recursive call
      0 references
      computational complexity
      0 references
      combinatorial algorithms
      0 references
      string matching
      0 references
      permutation generation
      0 references
      arithmetic algorithms
      0 references
      probabilistic algorithms
      0 references
      FFT
      0 references
      NP- complete problems
      0 references
      approximation algorithms
      0 references
      This book is one in the series on information science, and is devoted to present typical efficient algorithms. It consists of 4 chapters. The first one is the introduction, discussing several fundamental notions such as recursive call and computational complexity. The second chapter is entitled ''combinatorial algorithms'', and stresses to algorithms concerning graphs. For example, the chapter contains several interesting searching algorithms, as well as algorithms finding the shortest distances in a graph, or the maximum flow in a network. Further, string matching and permutation generation are discussed. The third chapter is devoted to arithmetic algorithms, including probabilistic algorithms in number theory. FFT and its applications are also included. The final chapter is entitled ''NP-complete problems and approximation algorithms''. The book is designed as a textbook of mathematical foundations of computer sciences both for graduate and undergraduate level. The contents are quite consise, widely ranged and suitable. Most of the important algorithms are given in Pascal-like style, which is quite helpful not only for studying the algorithms but also for learning the design of algorithms and the notion of complexity.
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references