~/talk

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

links:none on file
slides:none on file

Shows NP‑hardness gaps for concrete meta‑complexity problems: under subexponentially‑secure indistinguishability obfuscation/witness encryption the conditional time‑bounded Kolmogorov complexity Kt(x|y) is NP‑hard to approximate up to essentially optimal (nearly maximal vs polynomially small) gaps in the superlinear time regime; using SNARGs and multilinear‑map style constructions the reductions are syntactic and black‑box; unconditionally proves MOCSP is NP‑hard to approximate with Yes instances of size s and No instances ≥ s^c.

AI-written summary · about

  1. 0:00Introduction
  2. 0:30Joint work
  3. 0:55Eric Allender
  4. 1:35First email from Eric
  5. 3:09Working with Eric
  6. 7:43NPHardness and Cryptography
  7. 14:31Cryptographic Objects
  8. 16:55Conditional MetaComplexity
  9. 27:57Witness Encryption
  10. 33:17Proof
  11. 34:37Encryption
  12. 37:07Unconditional
  13. 39:37Secret Sharing
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.