bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication Hervé Fournier Nutan Limaye Guillaume Malod Srikanth Srinivasan [github]
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees Guillaume Lagarde Nutan Limaye Srikanth Srinivasan [github]
Cost Register Automata for Nested Words Andreas Krebs Nutan Limaye Michael Ludwig [github]
Counting Paths in VPA Is Complete for NC1 Andreas Krebs Nutan Limaye Meena Mahajan [github]
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata Nutan Limaye Meena Mahajan Antoine Meyer [github]
Planar Graph Isomorphism is in Log-Space Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner [github]
Planar Graph Isomorphism is in Log-Space Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner [github]
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas Neeraj Kayal Nutan Limaye Chandan Saha Srikanth Srinivasan [github]
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits Nutan Limaye Srikanth Srinivasan Sebastien Tavenas [github]

Library Size: 13G (9 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge
[show logs] [hide logs]