Zobrazeno 1 - 10
of 357
pro vyhledávání: '"Ramya, C."'
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 deterministic po
Externí odkaz:
http://arxiv.org/abs/2209.04797
Autor:
Ramya, C., Tengse, Anamay
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 ROABPs, we s
Externí odkaz:
http://arxiv.org/abs/2201.06432
The amplitude-dependent frequency of the oscillations, termed \emph{nonisochronicity}, is one of the essential characteristics of nonlinear oscillators. In this paper, the dynamics of the Rossler oscillator in the presence of nonisochronicity is exam
Externí odkaz:
http://arxiv.org/abs/2105.00219
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 vectors of all
Externí odkaz:
http://arxiv.org/abs/2012.07056
Autor:
Ramya, C.
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 know rigid
Externí odkaz:
http://arxiv.org/abs/2009.09460
The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower bounds in algeb
Externí odkaz:
http://arxiv.org/abs/2004.14147
Autor:
Ramya, C., Rao, B. V. Raghavendra
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,\ldots,x_n\}$ a
Externí odkaz:
http://arxiv.org/abs/1901.04377
Autor:
Ramya, C., Rao, B. V. Raghavendra
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 terminal node. Pr
Externí odkaz:
http://arxiv.org/abs/1804.08810
Autor:
Lee, Charlotte, Drobni, Zsofia D., Zafar, Amna, Gongora, Carlos A., Zlotoff, Daniel A., Alvi, Raza M., Taron, Jana, Rambarat, Paula K., Schoenfeld, Sara, Mosarla, Ramya C., Raghu, Vineet K., Hartmann, Sarah E., Gilman, Hannah K., Murphy, Sean P., Sullivan, Ryan J., Faje, Alexander, Hoffmann, Udo, Zhang, Lili, Mayrhofer, Thomas, Reynolds, Kerry L., Neilan, Tomas G.
Publikováno v:
In JACC: CardioOncology December 2022 4(5):660-669
Autor:
Mosarla, Ramya C., Armstrong, Ehrin, Bitton-Faiwiszewski, Yonatan, Schneider, Peter A., Secemsky, Eric A.
Publikováno v:
In Journal of the Society for Cardiovascular Angiography & Interventions September-October 2022 1(5)