Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction

zbMATH Open0998.68063MaRDI QIDQ2757288

Juraj Hromkovič

Publication date: 26 November 2001

zbMATH Keywords

complexity theoryalgorithmicstheoretical informatics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. 👍 👎
• Complexity theory and cryptology. An introduction to cryptocomplexity. 👍 👎
• Theoretic computer science. An introduction 👍 👎
• Algorithmische Informationstheorie 👍 👎
• Komplexitätstheorie und Kryptologie 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757288)