Opening book details…
About this nonfiction
Computer Science, Algorithms and Complexity by Adele Kuzmiakova is a nonfiction available to read on EtoBox.
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Adele Kuzmiakova
- Publisher
- Arcler Education Inc
- Published
- 2020
- Language
- EN
- ISBN
- 9781774077481
- Category
- nonfiction
More by Adele Kuzmiakova
Browse all works by Adele Kuzmiakova
Similar books
- Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) — Davis, Martin, Sigal, Ron, Weyuker, Elaine J. (1994)
- Randomness and Completeness in Computational Complexity (Lecture Notes in Computer Science, 1950) — Dieter van Melkebeek (2000)
- Descriptive Complexity (texts In Computer Science) — Neil Immerman (auth.) (1999)
- Combinatorial Optimization : Algorithms and Complexity — Christos H. Papadimitriou, Kenneth Steiglitz,Prentice Hall (1982)
- Complexity Theory of Real Functions (Progress in Theoretical Computer Science) — Ker-I Ko (auth.) (1991)
- Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) — Richard Lassaigne, Michel de Rougemont (auth.) (2004)