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 2018Show all

2 papers · 1 filter

cs.CC2018

Sensitivity, Affine Transforms and Quantum Communication Complexity

Krishnamoorthy Dinesh, Jayalal Sarma

We study the Boolean function parameters sensitivity (), block sensitivity (), and alternation () under specially designed affine transform…

cs.CC2018★ 11 cited

New Bounds for Energy Complexity of Boolean Functions

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma

For a Boolean function $f:\…