Showing cs.DMShow all
2 papers · 1 filter
cs.DM2008
Circumference, Chromatic Number and Online Coloring
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
Erdös conjectured that if is a triangle free graph of chromatic number at least , then it contains an odd cycle of length at least \cite{sudakovverstraete…
cs.DM2001
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
We consider the problem of computing the second elementary symmetric polynomial S^2_n(X) using depth-three arithmetic circuits of the form "sum of products of linear forms". We con…