3 citations · 8 across the 7 of their papers we have counts for
Showing 2016 · cs.CCShow all
2 papers · 2 filters
cs.CC2016
Did the Train Reach its Destination: The Complexity of Finding a Witness
Karthik C. S.
Recently, Dohrau et al. studied a zero-player game on switch graphs and proved that deciding the termination of the game is in NP coNP. In this short paper, we show that the…
cs.CC2016
On the Sensitivity Conjecture for Disjunctive Normal Forms
Karthik C. S., Sébastien Tavenas
The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function , the maximum sensitivity , is polynomially related to its block sensitivity…