Jayalal Sarma

activity

20082026

most citedDeterministic Identity Testing of Read-Once Algebraic Branching Programs

11 citations · 33 across the 22 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

cs.CC2025

Sensitivity and Query Complexity under Uncertainty

Deepu Benson, Balagopal Komarath, Nikhil Mande +3

In this paper, we study the query complexity of Boolean functions in the presence of uncertainty, motivated by parallel computation with an unlimited number of processors where inp…

cs.CC2025

Range Avoidance in Boolean Circuits via Turan-type Bounds

Neha Kuntewar, Jayalal Sarma

Given a circuit $C : {0, 1}^{n} \to {0, 1}^{m}$ from a circuit class $F$ , with $m > n$ , finding a $y \in {0, 1}^{m}$ such that $\forall x \in {0, 1}^{n}$ , $C (x) \neq = y$ , is the range av…

cs.CC2025

Hazard-free Decision Trees

Deepu Benson, Balagopal Komarath, Jayalal Sarma +1

Decision trees are one of the most fundamental computational models for computing Boolean functions $f : {0, 1}^{n} \mapsto {0, 1}$ . It is well-known that the depth and size of d…