{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihvgvg6j5odvgoyad544z4q55v7tdkwziehcokiwrqga3qzto3uea",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mi6u3he3ukq2"
  },
  "path": "/report/2026/041",
  "publishedAt": "2026-03-29T06:42:44.000Z",
  "site": "https://eccc.weizmann.ac.il",
  "textContent": "Recently, together with Kulikov, Mihajlin, and Smirnova (STACS 2026), we gave conditional constructions of functions with large monotone circuit complexity, matrices with high rigidity, and $3$-dimensional tensors of strongly superlinear rank. In this note, I strengthen the rigidity construction under the same assumption and, as a direct consequence, immediately obtain a slightly improved trade-off theorem for tensor rank.",
  "title": "TR26-041 |  A Note on Conditional Complexity Hardness of Matrix Rigidity and Tensor Rank | \n\n\tNikolai Chukhin"
}