Algebraic Cryptography Center

Organizers: Alex Myasnikov and Sasha Ushakov

Wednesdays 1:30.
Room: Pierce 309 (Conference room)
Subscribe to receive automatic announcements about the seminar

Next talk:

PLEASE NOTE TIME CHANGE: 2:00PM

Previous talks:

• April 2. A. Ushakov. "Hilbert's Tenth Problem: an introduction."
• March 26. A. Ushakov. "Hilbert's Tenth Problem: an introduction."
• Feb 27. R. Gilman, "Hard Functions."
• Feb 20. R. Gilman, "Generating difficult instances of hard problems."

Complexity cores and hard functions:

• Nancy Lynch. On Reducibility to Complex or Sparse Sets.
• Ronald Book, Ding-Zhu Du, The existence and density of generalized complexity cores.
• Elvira Mayordomo. Almost every set in exponential time is P-Bi-Immune.
• P. Nguyen, J. Stern. The two faces of lattices in cryptology.

Hilbert's Tenth Problem:

• Yuri Matiyasevich, Hilbert's 10th Problem (Foundations of Computing).