• Skip to primary navigation
  • Skip to content
  • Skip to footer
Ramprasad Saptharishi
  • Publications
  • Courses
  • Talks
  • Students
  • Contact
    • Current/upcoming
      • Complexity Theory (2025-I)
    • Past
      • Algebraic Circuit Complexity (2024-II)
      • Complexity Theory (2024-I)
      • Pseudorandomness (2023-II)
      • Complexity Theory (2023-I)
      • Topics in alg. geometry (2023-I)
      • Algebra and Computation (2022-I)
      • Pseudorandomness (2021-II)
      • Complexity Theory (2021-I)
      • Analysis of Boolean Functions
      • Algebra and Computation: A reading course (2020-I)
      • Reading/Watching Group on Complexity
      • Cryptography (2019-II)
      • Algebra and Computation (2019-II)
      • Pseudorandomness (2018-II)
      • Alg. Circuit Complexity (2017-II)
      • Algebra and Computation (2017-I)

    Algebra and Computation: A reading course (2020, Jan–May)

    (Tuesday 1600 — 1730) & (Fri 1130 — 1300) @ A 201

    Previous offerings of this course:

    • 2017 @ TIFR
    • 2019 @ TIFR

    Resources

    • Lecture notes from a previous offering of the course.
    • “Lectures on Polynomial-Time Computation in Groups” by Eugene Luks
    • “Algebra and Computation” (2012) by Madhu Sudan
    • “Algebra and Computation” (1998) by Madhu Sudan
    • “Permutation puzzles” by Jamie Mulholland
    • GitHub
    • Bitbucket
    • GPG Public Key
    © 2025 Ramprasad Saptharishi. Powered by Jekyll & Minimal Mistakes.
    Last updated: 2025-05-13 16:24:25 +0530.