scientific article; zbMATH DE number 2166299

zbMATH Open1069.68046MaRDI QIDQ4673626

Juraj Hromkovič

Publication date: 6 May 2005

Title of this publication is not available (Why is that?)

zbMATH Keywords

randomizationcryptographyKolmogorov complexitycomputability theorycomplexity theorypublic-key cryptosystemsalgorithmicstheoretical computer scienceCook's theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Authentication, digital signatures and secret sharing (94A62) General topics in the theory of computing (68Q01)

Related Items (3)

Komplexitätstheorie und Kryptologie ⋮ Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction ⋮ Theoretical informatics. An extensive introduction

This page was built for publication:

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