The following pages link to M. N. Jayalal Sarma (Q475334):
Displaying 50 items.
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- (Q626663) (redirect page) (← links)
- Upper bounds for monotone planar circuit value and variants (Q626664) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- (Q963423) (redirect page) (← links)
- Rigidity of a simple extended lower triangular matrix (Q963424) (← links)
- (Q1640990) (redirect page) (← links)
- Comparator circuits over finite bounded posets (Q1640992) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- Testing polynomial equivalence by scaling matrices (Q1679963) (← links)
- Power of decision trees with monotone queries (Q2019471) (← links)
- On the mystery of negations in circuits: structure vs power (Q2019505) (← links)
- On the computational power of programs over \(\mathsf{BA}_2\) monoid (Q2232262) (← links)
- On the complexity of matrix rank and rigidity (Q2268340) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps (Q2636568) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Pebbling, Entropy, and Branching Program Size Lower Bounds (Q2828231) (← links)
- Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs (Q2908859) (← links)
- (Q2911617) (← links)
- Using Elimination Theory to construct Rigid Matrices (Q2920137) (← links)
- Depth Lower Bounds against Circuits with Sparse Orientation (Q2920496) (← links)
- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth (Q2922620) (← links)
- Pebbling, Entropy and Branching Program Size Lower Bounds. (Q2957923) (← links)
- Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space (Q2978550) (← links)
- (Q3113720) (← links)
- (Q3191148) (← links)
- Reversible Pebble Game on Trees (Q3196374) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- On the Complexity of Matrix Rank and Rigidity (Q3499780) (← links)
- Balancing Bounded Treewidth Circuits (Q3569746) (← links)
- Limiting Negations in Bounded Treewidth and Upward Planar Circuits (Q3586102) (← links)
- Depth Lower Bounds against Circuits with Sparse Orientation* (Q4595590) (← links)
- Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. (Q4636585) (← links)
- On Directed Tree Realizations of Degree Sets (Q4914456) (← links)
- Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices (Q4973853) (← links)
- Min/Max-Poly Weighting Schemes and the NL versus UL Problem (Q4973887) (← links)
- On the Complexity of L-reachability* (Q4976380) (← links)
- Characterization and Lower Bounds for Branching Program Size using Projective Dimension (Q5205793) (← links)
- Arithmetic Circuit Lower Bounds via MaxRank (Q5326600) (← links)
- Evaluating Monotone Circuits on Cylinders, Planes and Tori (Q5449839) (← links)
- On the Complexity of L-reachability (Q5496194) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- New bounds for energy complexity of Boolean functions (Q5916262) (← links)
- On pure space vs catalytic space (Q5918608) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- New bounds for energy complexity of Boolean functions (Q5918995) (← links)
- On pure space vs catalytic space (Q5970816) (← links)
