Nashlen Govindasamy

Orcid: 0000-0002-7191-9829

According to our database1, Nashlen Govindasamy authored at least 2 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Lower Bounds against the Ideal Proof System in Finite Fields.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2022
Simple Hard Instances for Low-Depth Algebraic Proofs.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022


  Loading...