C. Ramya
YOU?
Author Swipe
View article: Efficient Polynomial Identity Testing Over Nonassociative Algebras
Efficient Polynomial Identity Testing Over Nonassociative Algebras Open
We design the first efficient polynomial identity testing algorithms over the nonassociative polynomial algebra. In particular, multiplication among the formal variables is commutative but it is not associative. This complements the strong…
View article: Smart Voting System
Smart Voting System Open
The Smart Voting System is highly secured and involves verification of voters at 2 levels.It illustrates the hardware and software aspects of the project.The voting machine will be able to take in finger prints and eye image as inputs and …
View article: On Identity Testing and Noncommutative Rank Computation over the Free Skew Field
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field Open
The identity testing of rational formulas (RIT) in the free skew field efficiently reduces to computing the rank of a matrix whose entries are linear polynomials in noncommuting variables\cite{HW15}. This rank computation problem has deter…
View article: On Finer Separations between Subclasses of Read-once Oblivious ABPs
On Finer Separations between Subclasses of Read-once Oblivious ABPs Open
Read-once Oblivious Algebraic Branching Programs (ROABPs) compute polynomials as products of univariate polynomials that have matrices as coefficients. In an attempt to understand the landscape of algebraic complexity classes surrounding R…
View article: If VNP Is Hard, Then so Are Equations for It
If VNP Is Hard, Then so Are Equations for It Open
Assuming that the Permanent polynomial requires algebraic circuits of exponential size, we show that the class VNP does not have efficiently computable equations. In other words, any nonzero polynomial that vanishes on the coefficient vect…
View article: Classifying the Unstructured IT Service Desk Tickets Using Ensemble of Classifiers
Classifying the Unstructured IT Service Desk Tickets Using Ensemble of Classifiers Open
Manual classification of IT service desk tickets may result in routing of the tickets to the wrong resolution group. Incorrect assignment of IT service desk tickets leads to reassignment of tickets, unnecessary resource utilization and del…
View article: A PSO Strategy of Finding Relevant Web Documents using a New Similarity Measure
A PSO Strategy of Finding Relevant Web Documents using a New Similarity Measure Open
In the world of the Internet and World Wide Web, which offers a tremendous amount of information, an increasing emphasis is being given to searching services and functionality. Currently, a majority of web portals offer their searching uti…
View article: An Effective RGB Image Encryption Algorithm Using Chaotic Maps And Memory Cellular Automata
An Effective RGB Image Encryption Algorithm Using Chaotic Maps And Memory Cellular Automata Open
This paper proposes an efficient algorithm for en- ciphering digital RGB images. It makes use of two different dynamical systems. One is chaotic maps and the other is memory cellular automata. The algorithm uses the hash function SHA - 256…
View article: On the Existence of Algebraically Natural Proofs
On the Existence of Algebraically Natural Proofs Open
For every constant $c > 0$, we show that there is a family $\{P_{N, c}\}$ of polynomials whose degree and algebraic circuit complexity are polynomially bounded in the number of variables, that satisfies the following properties:
$\bullet…
View article: Recent Progress on Matrix Rigidity -- A Survey
Recent Progress on Matrix Rigidity -- A Survey Open
The concept of matrix rigidity was introduced by Valiant(independently by Grigoriev) in the context of computing linear transformations. A matrix is rigid if it is far(in terms of Hamming distance) from any matrix of low rank. Although we …
View article: Efficient Bus Pass Generation and Authentication using QR Code
Efficient Bus Pass Generation and Authentication using QR Code Open
The main aim of the project is to effective bus pass generation and authentication using QR code. In this project the entire bus pass generation is made as a online application. So one can easily apply and renew their bus pass in a simple …
View article: A Novel PSO Methodology for Web Documents Retrieval
A Novel PSO Methodology for Web Documents Retrieval Open
This paper focuses on retrieval of web documents with improved response time and similarity using particle swarm optimization (PSO) technique.Since the nature of the web data is distributed, volatile and uncertain, an accurate and speedy a…
View article: A PSO Strategy of Finding Relevant Web Documents using a New Similarity Measure
A PSO Strategy of Finding Relevant Web Documents using a New Similarity Measure Open
In the world of the Internet and World Wide Web, which offers a tremendous amount of information, an increasing emphasis is being given to searching services and functionality.Currently, a majority of web portals offer their searching util…
View article: Lower bounds for multilinear bounded order ABPs
Lower bounds for multilinear bounded order ABPs Open
Proving super-polynomial size lower bounds for syntactic multilinear Algebraic Branching Programs(smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in $\{x_1,\ldo…
View article: Lower Bounds for Multilinear Order-Restricted ABPs
Lower Bounds for Multilinear Order-Restricted ABPs Open
Proving super-polynomial lower bounds on the size of syntactic multilinear Algebraic Branching Programs (smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in {x_1…
View article: Lower Bounds for Special Cases of Syntactic Multilinear ABPs
Lower Bounds for Special Cases of Syntactic Multilinear ABPs Open
Algebraic Branching Programs(ABPs) are standard models for computing polynomials. Syntactic multilinear ABPs (smABPs) are restrictions of ABPs where every variable is allowed to occur at most once in every path from the start to the termin…
View article: Linear Projections of the Vandermonde Polynomial
Linear Projections of the Vandermonde Polynomial Open
An n-variate Vandermonde polynomial is the determinant of the n x n matrix where the ith column is the vector (1, x_i, x_i^2, ...., x_i^{n-1})^T. Vandermonde polynomials play a crucial role in the theory of alternating polynomials and occu…
View article: Sum of Products of Read-Once Formulas
Sum of Products of Read-Once Formulas Open
We study limitations of polynomials computed by depth two circuits built over read-once formulas (ROFs). In particular,
\n
\n1. We prove an exponential lower bound for the sum of ROFs computing the 2n-variate polynomial in VP defined by R…