logo
  • Articles
  • Editors
  • Submit
  • Search
  • Home
  • About
  • Articles
  • Special Issues
  • Graduate Surveys
  • Library
  • Editors
  • Submit
  • Search
Articles under category:
Meta-Complexity
Vol 22, Article 2064 (pp 1-74) [CCC21 Spec Issue]
Hardness of KT Characterizes Parallel Cryptography
by Hanlin Ren and Rahul Santhanam
Vol 19, Article 4 (pp 1-61) [CCC20 Spec Issue]
Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions
by Shuichi Hirahara