{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreibdsg4jh2gmn233i2rs33awie7on2dfi4vbllliurf2cpn3q7i3rq",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mjivyqqvuzn2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreifqaymphlhaou7ymuxlsdcq46k6c4k27dbs2lrqq2rxp5ioaxmdoy"
    },
    "mimeType": "image/jpeg",
    "size": 8554
  },
  "path": "/2026/04/14/tcs-talk-wednesday-april-22-yichuan-wang-uc-berkeley/",
  "publishedAt": "2026-04-14T20:32:40.000Z",
  "site": "https://tcsplus.wordpress.com",
  "tags": [
    "the online form",
    "on our website",
    "suggest",
    "the website"
  ],
  "textContent": "The next TCS+ talk will take place this coming Wednesday, April 22th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 19:00 Central European Time, 17:00 UTC). **Yichuan Wang** from UC Berkeley will speak about “ _Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits_ ” (abstract below).\n\nYou can reserve a spot as an individual or a group to join us live by signing up on the online form. Registration is _not_ required to attend the interactive talk, and the link will be posted on the website the day prior to the talk; however, by registering in the form, you will receive a reminder, along with the link. (The recorded talk will also be posted on our website afterwards) As usual, for more information about the TCS+ online seminar series and the upcoming talks, or to suggest a possible topic or speaker, please see the website.\n\n> Abstract: Proving lower bounds against depth-2 linear threshold circuits (a.k.a. THR ◦ THR) is one of the frontier questions in complexity theory. Despite tremendous effort, our best lower bounds for THR ◦ THR only hold for sub-quadratic number of gates, which was proven a decade ago by Tamaki (ECCC TR16) and Alman, Chan, and Williams (FOCS 2016) for a hard function in E^NP.\n>\n> In this work, we prove that there is a function f in E^NP that requires -size THR ◦ THR circuits for any . We obtain our new results by designing a new non-trivial algorithm for estimating the acceptance probability of an XOR of two -size THR ◦ THR circuits, and apply Williams’ algorithmic method to obtain the desired lower bound.\n\nBy plustcs",
  "title": "TCS+ talk: Wednesday, April 22 — Yichuan Wang, UC Berkeley"
}