Explonential lower bounds via exponential sum
ACMU seminar, ISI Kolkata
STCS Seminar, TIFR Mumbai
A study on Rank Computation problem for Linear matrices
MSc Thesis Presentation, CMI
"Decidability in Timed Communication Automata" by Clemente
Course-work presentation (Timed Automata), CMI
"Linear Matroid Intersection is in QuasiNC" by Gurjar and Thierauf
Course-work presentation (Parallel Algorithm and Complexity), CMI
"BPSPACE(S) in DSPACE(S^{3/2})" by Saks and Zhou
Course-work presentation (Complexity Theory II), CMI
"An O(n log^2 n) Algorithm for Maximum Flow in Undirected Planar Networks" by Hassin and Johnson
Course-work presentation (Matching and Flow Algorithms), CMI
"Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE” by Agrawal, Boneh and Boyen
Course-work presentation (Structure vs Hardness in Cryptography), IITM
Progress on PIT
CMI Student Seminar, 2021
Oct'23-Jan'24
In this project, I studied upper bounds and lower bounds for the proof-size of non commutative ABPs (which are commutatively zero) using commutators as axioms.
Summer 2023
In this project I tried to find black box subexponential approximate algorithm for edmonds’ problem using Bläser-Jindal-Pandey idea. I also read about algorithms for matroids using edmonds’ problem (commutative and non-commutative both) algorithms.
Oct'22-Jan'24
Worked on The conditional optimality of Ryser formula: Algebraic version of Strong ETH with prof.
Markus Bläser,
Pranjal Dutta and Saswata Mukherjee
In this project I learned about parameterized complexity and fine grained complexity and their relation with algebraic complexity. We finally achieve exponential lower bound in parameterized valiant classes from tau-conjecture. This project leads to the paper Exponential Lowerbounds via Exponential sums.
Summer 2022
Study on Uniform Determinantal Complexity under prof.
Markus Bläser with my batchmate Saswata Mukherjee
We improved the upper and lower bounds for restricted generic polynomials with/without help of approximation. I will upload the report oneday
Feb-Apr'22
Reading project on Border complexity under prof.
Partha Mukhopadhyay with my batchmate Saswata Mukherjee
Summer 2021
Polynomial Identity Testing and Diagonal Circuit under prof.
Nitin Saxena with my batchmate Saswata Mukherjee
We did a basic study on PIT and focus on studying PIT for RO-ABPs
||
Report||