S. Raja

Affiliations:
  • Institute of Technology (IIT) Tirupati, India
  • Institute of Mathematical Sciences, Chennai, India (former, PhD)


According to our database1, S. Raja authored at least 13 papers between 2010 and 2024.

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

2024
Randomized Black-Box PIT for Small Depth +-Regular Non-commutative Circuits.
Electron. Colloquium Comput. Complex., 2024

2021
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2019
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.
Theory Comput., 2019

2017
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
Electron. Colloquium Comput. Complex., 2017

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
Electron. Colloquium Comput. Complex., 2016

Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
Electron. Colloquium Comput. Complex., 2016

Some Lower Bound Results for Set-Multilinear Arithmetic Computations.
Chic. J. Theor. Comput. Sci., 2016

2015
Noncommutative Valiant's Classes: Structure and Complete Problems.
Electron. Colloquium Comput. Complex., 2015

2014
The Complexity of Two Register and Skew Arithmetic Computation.
Electron. Colloquium Comput. Complex., 2014

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.
Proceedings of the Computer Science - Theory and Applications, 2014

The Complexity of Bounded Register and Skew Arithmetic Computation.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2010
Necessary and sufficient conditions for success of the metropolis algorithm for optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010


  Loading...