Notes and Talks

Notes

  • Some Complexity Measures for Boolean Functions
  • Counting Spanning Trees
  • Winding Numbers

    • Talks

  • Integer Factorization Algorithms
  • Lattice-based Pseudorandom Random Functions
  • Pseudorandomness : A Very Short Introduction Presented at ACM-Class Student Academic Festival 2021.
  • A Glance at Computational Complexity This is a lecture for freshmen at ACM Honor Class, SJTU.