Anamay Tengse
@anamay-tengse.bsky.social
Interested in maths, music, poetry and cricket.
Very interested, and therefore working, in theoretical CS.
Very interested, and therefore working, in theoretical CS.
We at SCoS, NISER, are looking for motivated students interested in the theoretical aspetcs of computing; details in the poster below.
Prior coursework in CS is encouraged, but not necessary. However, mathematical maturity and algorithmic thinking are essential.
Prior coursework in CS is encouraged, but not necessary. However, mathematical maturity and algorithmic thinking are essential.
October 18, 2025 at 8:54 AM
We at SCoS, NISER, are looking for motivated students interested in the theoretical aspetcs of computing; details in the poster below.
Prior coursework in CS is encouraged, but not necessary. However, mathematical maturity and algorithmic thinking are essential.
Prior coursework in CS is encouraged, but not necessary. However, mathematical maturity and algorithmic thinking are essential.
Finding the order of a read-once algebraic branching program is NP-hard.
Even when the polynomial is given as sum-of-monomials!
Even for constant degree!!
Even when the polynomial is given as sum-of-monomials!
Even for constant degree!!
Vishwas Bhargava, Pranjal Dutta, Sumanta Ghosh, Anamay Tengse
The Complexity of Order-Finding for ROABPs
https://arxiv.org/abs/2411.18981
The Complexity of Order-Finding for ROABPs
https://arxiv.org/abs/2411.18981
December 3, 2024 at 10:32 AM
Finding the order of a read-once algebraic branching program is NP-hard.
Even when the polynomial is given as sum-of-monomials!
Even for constant degree!!
Even when the polynomial is given as sum-of-monomials!
Even for constant degree!!