Tweetovi

Blokirali ste korisnika/cu @BooleanAnalysis

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @BooleanAnalysis

  1. Asymptotics of the Harmonic Numbers H_n -- part (b) of Lecture 2 of my CS Theory Toolkit course.

    Poništi
  2. 3. velj

    Big O and Friends -- part (a) of Lecture 2 of my CS Theory Toolkit course. Watch for my controversial takes on O() notation.

    Poništi
  3. 22. sij

    First TCS Toolkit lectures now on YouTube: Part 1: Course Overview, Syllabus, and Logistics () Part 2: How to TCS () Part 3: Street Fighting Mathematics ()

    Prikaži ovu nit
    Poništi
  4. 22. sij

    Starting to put up YouTube lectures for "TCS Toolkit", a new course for PhD and advanced undergrad students with an interest in Theoretical Computer Science (TCS). Idea is to go over fundamental math and CS topics needed for basic research in TCS.

    Prikaži ovu nit
    Poništi
  5. 14. sij

    MIP* = RE, by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen: . There is a multiple-entagled-quantum-provers proof system for the Halting Problem, and Connes' Embedding Conjecture is false.

    Poništi
  6. proslijedio/la je Tweet
    6. stu 2019.

    Check out Ryan O'Donnell's () talk on explicit constructions of near-Ramanujan graphs!

    Poništi
  7. 9. srp 2019.

    New talk on YouTube: "Explicit near-Ramanujan graphs of every degree", joint work with Sidhanth Mohanty () and Pedro Paredes (). Sorry the first 45 seconds of the talk were cut off from the video!

    Poništi
  8. 1. srp 2019.

    Hao Huang@Emory: Ex.1: ∃edge-signing of n-cube with 2^{n-1} eigs each of +/-sqrt(n) Interlacing=>Any induced subgraph with >2^{n-1} vtcs has max eig >= sqrt(n) Ex.2: In subgraph, max eig <= max valency, even with signs Hence [GL92] the Sensitivity Conj, s(f) >= sqrt(deg(f))

    Poništi
  9. 10. lis 2018.

    My lectures on Quantum Computation and Information at Carnegie Mellon are being filmed this semester. On Youtube, Thursdays and Saturdays.

    Poništi
  10. proslijedio/la je Tweet

    Currently reading O'Donnell's Analysis of Boolean Functions. One of my best friends loves the stuff, and I'm starting to see what all the fuss is about! Highly recommended if you enjoy discrete math! PDF here:

    Poništi
  11. 22. ruj 2017.

    my Graduate Complexity Theory course at CMU is being filmed this semester; lectures on YouTube (Wed. & Fri) at

    Poništi
  12. 23. srp 2017.
    Poništi
  13. 11. kol 2016.

    Yearly forgot-to-renew-domain post. Ditched the .org address. Now go to or download PDF at

    Poništi
  14. 14. srp 2015.

    Sorry that was down for a while. Back up now.

    Poništi
  15. 30. lis 2014.

    Analysis of Boolean Functions book PDF now freely available at

    Poništi
  16. 1. ruj 2014.
    Poništi
  17. 14. kol 2014.
    Poništi
  18. 12. kol 2014.

    Subhash Khot accepts the Nevanlinna Prize from the President of Korea.

    Poništi
  19. 29. svi 2014.
    Poništi
  20. 29. svi 2014.

    Some tips (on analysis of Boolean functions) posted at

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·