M. N. Jayalal Sarma

Available identifiers

zbMath Open sarma-m-n.jayalalMaRDI QIDQ475334

List of research outcomes

Publication	Date of Publication	Type
Separating words problem over groups	2023-08-17	Paper
Rotation distance for rank bounded trees	2023-08-10	Paper
On pure space vs catalytic space	2022-12-22	Paper
On pure space vs catalytic space	2022-05-23	Paper
On the computational power of programs over \(\mathsf{BA}_2\) monoid	2021-10-04	Paper
Power of decision trees with monotone queries	2021-04-21	Paper
On the mystery of negations in circuits: structure vs power	2021-04-21	Paper
New bounds for energy complexity of Boolean functions	2020-10-22	Paper
Sensitivity, affine transforms and quantum communication complexity	2020-09-01	Paper
Sensitivity, affine transforms and quantum communication complexity	2020-02-24	Paper
Characterization and Lower Bounds for Branching Program Size using Projective Dimension	2019-12-16	Paper
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices	2019-12-06	Paper
Min/Max-Poly Weighting Schemes and the NL versus UL Problem	2019-12-06	Paper
Space complexity of reachability testing in labelled graphs	2019-08-07	Paper
Alternation, sparsity and sensitivity: bounds and exponential gaps	2019-05-17	Paper
New bounds for energy complexity of Boolean functions	2018-10-04	Paper
Comparator circuits over finite bounded posets	2018-06-14	Paper
Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps	2018-06-05	Paper
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.	2018-04-19	Paper
Depth Lower Bounds against Circuits with Sparse Orientation*	2017-12-05	Paper
Testing polynomial equivalence by scaling matrices	2017-11-22	Paper
Balancing bounded treewidth circuits	2017-11-07	Paper
Pebbling meets coloring: reversible pebble game on trees	2017-10-11	Paper
On the Complexity of L-reachability*	2017-07-28	Paper
Space Complexity of Reachability Testing in Labelled Graphs	2017-06-01	Paper
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space	2017-04-25	Paper
Pebbling, Entropy and Branching Program Size Lower Bounds.	2017-01-30	Paper
Pebbling, Entropy, and Branching Program Size Lower Bounds	2016-10-24	Paper
Reversible Pebble Game on Trees	2015-10-29	Paper
Comparator circuits over finite bounded posets	2015-10-27	Paper
Using elimination theory to construct rigid matrices	2014-11-26	Paper
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth	2014-10-14	Paper
Depth Lower Bounds against Circuits with Sparse Orientation	2014-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q3191148	2014-09-24	Paper
On the Complexity of L-reachability	2014-08-07	Paper
On isomorphism testing of groups with normal Hall subgroups	2014-02-11	Paper
Arithmetic Circuit Lower Bounds via MaxRank	2013-08-06	Paper
On Directed Tree Realizations of Degree Sets	2013-04-12	Paper
Using Elimination Theory to construct Rigid Matrices	2012-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q2911617	2012-08-31	Paper
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs	2012-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q3113720	2012-01-23	Paper
On the complexity of matroid isomorphism problem	2011-10-11	Paper
Upper bounds for monotone planar circuit value and variants	2011-02-18	Paper
Limiting Negations in Bounded Treewidth and Upward Planar Circuits	2010-09-03	Paper
Balancing Bounded Treewidth Circuits	2010-06-22	Paper
Rigidity of a simple extended lower triangular matrix	2010-04-19	Paper
On the complexity of matrix rank and rigidity	2010-03-05	Paper
On the Complexity of Matroid Isomorphism Problems	2009-08-18	Paper
On the Complexity of Matrix Rank and Rigidity	2008-06-03	Paper
Evaluating Monotone Circuits on Cylinders, Planes and Tori	2008-03-19	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: M. N. Jayalal Sarma