The following pages link to B. V. Raghavendra Rao (Q371193):
Displaying 37 items.
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Testing polynomial equivalence by scaling matrices (Q1679963) (← links)
- On \(\varSigma\wedge\varSigma\wedge\varSigma\) circuits: the role of middle \(\varSigma\) fan-in, homogeneity and bottom degree (Q1679975) (← links)
- On weak-space complexity over complex numbers (Q1679984) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
- On proving parameterized size lower bounds for multilinear algebraic models (Q2300038) (← links)
- On hard instances of non-commutative permanent (Q2306589) (← links)
- Linear projections of the Vandermonde polynomial (Q2330107) (← links)
- On constant depth circuits parameterized by degree: identity testing and depth reduction (Q2412414) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- On Hard Instances of Non-Commutative Permanent (Q2817859) (← links)
- A Probabilistic Analysis of Christofides’ Algorithm (Q2904559) (← links)
- (Q2911617) (← links)
- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs (Q2912764) (← links)
- Building above Read-once Polynomials: Identity Testing and Hardness of Representation (Q2920440) (← links)
- Small-Space Analogues of Valiant’s Classes (Q3183616) (← links)
- (Q3191148) (← links)
- Arithmetizing Classes Around NC 1 and L (Q3590957) (← links)
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
- (Q4636588) (← links)
- (Q5092414) (← links)
- Parameterized Analogues of Probabilistic Computation (Q5174962) (← links)
- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals (Q5199235) (← links)
- Lower bounds for Sum and Sum of Products of Read-once Formulas (Q5205795) (← links)
- Lower bounds for special cases of syntactic multilinear ABPs (Q5916261) (← links)
- Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Proper \(q\)-caterpillars are distinguished by their chromatic symmetric functions (Q6589141) (← links)
