• Skip to primary navigation
  • Skip to content
  • Skip to footer
Ramprasad Saptharishi
  • Publications
  • Courses
  • Talks
  • Students
  • Contact
    • Current/upcoming
      • Algebra and Computation (2022-I)
    • Past
      • 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)

    Courses

    Current/upcoming

    • [CSS.307.1] Algebra and Computation

    Past

    • [CSS.413.1] Pseudorandomness (2021-II) (co-teaching with Prahladh Harsha)
    • [CSS.203.1] Complexity Theory (2021-I) (co-taught with Prahladh Harsha)
    • [CSS.324.1] Analysis of Boolean Functions (2020-II)
    • Algebra and Computation: A reading course (2020-I)
    • Reading/watching Group on Complexity
    • Cryptography (2019-II)
    • Algebra and Computation (2019-I)
    • Pseudorandomness (2018-II)
    • Reading course, following “Ideals, Varieties and Algorithms” by Cox, Little and O’Shea.
    • Algebraic Circuit Complexity (2017-II)
    • Algebra and Computation (2017-I)
    • GitHub
    • Bitbucket
    • GPG Public Key
    © 2022 Ramprasad Saptharishi. Powered by Jekyll & Minimal Mistakes.
    Last updated: 2022-05-17 09:18:58 +0530.