scientific article; zbMATH DE number 5166135

zbMATH Open1128.68038MaRDI QIDQ5292492

Juraj Hromkovič

Publication date: 21 June 2007

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

zbMATH Keywords

Kolmogorov complexityzero-knowledge proofstheoretical computer science

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) 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) Theory of computing (68Qxx) General topics in the theory of computing (68Q01)

Recommendations

• Algorithms. From Hammurapi to Gödel 👍 👎
• Algorithmen von Hammurapi bis Gödel 👍 👎
• Title not available (Why is that?) 👍 👎
• 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:

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