Hardness of KT characterizes parallel cryptography
From MaRDI portal
Publication:6115398
DOI10.4230/lipics.ccc.2021.35OpenAlexW3184377287MaRDI QIDQ6115398
Publication date: 12 July 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14309/pdf/LIPIcs-CCC-2021-35.pdf/
Related Items (2)
Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
This page was built for publication: Hardness of KT characterizes parallel cryptography