research
∙
09/11/2022
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field
The identity testing of rational formulas (RIT) in the free skew field e...
share
research
∙
01/17/2022
On Finer Separations between Subclasses of Read-once Oblivious ABPs
Read-once Oblivious Algebraic Branching Programs (ROABPs) compute polyno...
research
∙
12/13/2020
If VNP is hard, then so are equations for it
Assuming that the Permanent polynomial requires algebraic circuits of ex...
research
∙
09/20/2020
Recent Progress on Matrix Rigidity – A Survey
The concept of matrix rigidity was introduced by Valiant(independently b...
research
∙
04/29/2020
On the Existence of Algebraically Natural Proofs
For every constant c > 0, we show that there is a family {P_N, c} of pol...
research
∙
01/14/2019
Lower bounds for multilinear bounded order ABPs
Proving super-polynomial size lower bounds for syntactic multilinear Alg...
research
∙
04/24/2018
Lower Bounds for Special Cases of Syntactic Multilinear ABPs
Algebraic Branching Programs(ABPs) are standard models for computing pol...
research
∙
09/06/2011
An Efficient Preprocessing Methodology for Discovering Patterns and Clustering of Web Users using a Dynamic ART1 Neural Network
In this paper, a complete preprocessing methodology for discovering patt...
research
∙
05/02/2011