Computer science, algorithms and complexity / edited by Adele Kuzmiakova

Contributor(s):

Kuzmiakova, Adele [editor]

Material type:

Computer fileLanguage: English Publication details: Burlington, Canada : Arcler Press, 2021Description: 1 online resource ( xviii, 276, pages) : color illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781774077481 (e-book)

Subject(s):

LOC classification:

QA164 C73 2021

Online resources:

Contents:

1. Basic techniques for design and analysis of algorithms -- 2. Computational complexity theory -- 3. Graph and network algorithms -- 4. Cryptography -- 5. Algebraic algorithms -- 6. Parallel algorithms -- 7. Randomized algorithms -- 8. Pattern matching and text compression algorithms -- 9. Genetic algorithms -- 10. Combinational optimization

Summary: The book defines complexity as a numerical function T (n)-the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of computational resources (time and space) consumed when a particular algorithm is running. For these issues, the book tries to locate heuristic algorithms which can almost explain the problem and operate in a reasonable timeframe. Different kinds of algorithms are described such as graph and network algorithms, algebraic algorithms, parallel algorithms and randomized algorithms.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 5 )

Holdings
Item type	Current library	Collection	Call number	Materials specified	Status	Notes	Date due	Barcode
Online E-Books	Ladislao N. Diwa Memorial Library Multimedia Section	Non-fiction	OEBP QA164 C73 2021 (Browse shelf(Opens below))		Available	PAV		OEBP000305
Compact Discs	Ladislao N. Diwa Memorial Library Multimedia Section	Non-fiction	EB QA164 C73 2021 (Browse shelf(Opens below))		Room use only	PAV		EB000305

https://portal.igpublish.com/iglibrary/ is required to read this e-book.

Includes bibliographical references and index

1. Basic techniques for design and analysis of algorithms -- 2. Computational complexity theory -- 3. Graph and network algorithms -- 4. Cryptography -- 5. Algebraic algorithms -- 6. Parallel algorithms --
7. Randomized algorithms -- 8. Pattern matching and text compression algorithms -- 9. Genetic algorithms -- 10. Combinational optimization

The book defines complexity as a numerical function T (n)-the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of computational resources (time and space) consumed when a particular algorithm is running. For these issues, the book tries to locate heuristic algorithms which can almost explain the problem and operate in a reasonable timeframe. Different kinds of algorithms are described such as graph and network algorithms, algebraic algorithms, parallel algorithms and randomized algorithms.

Fund 164 CE-Logic Purchased April 14, 2022 OEBP000305 Carmona Campus PHP No price 0000 0000