= Valentine Kabanets
{c}
<Valentine Kabanets> is a <computer scientist> whose research concerns <computational complexity theory>, <derandomization>, <pseudorandomness> and <circuit complexity>. A recurring question in his research is when efficient <randomized algorithms> can be replaced by efficient <deterministic algorithms>.<Research interests by Valentine Kabanets>[Computational Complexity; Role of randomness in efficient computation]{ref}
His research description emphasizes a connection between designing fast <algorithms> and proving <circuit lower bounds>. An upper bound supplies an efficient method for a problem; a lower bound rules out methods within a specified model. In some settings, progress on one side can imply progress on the other, turning apparent obstacles into tools.<Research interests by Valentine Kabanets>[Meta-algorithms versus Circuit lower bounds]{ref}
Identity source: https://www2.cs.sfu.ca/~kabanets/
\Image[https://www2.cs.sfu.ca/~kabanets/Kabanets-pic.jpg]
{title=Portrait of <Valentine Kabanets>}
{description=Portrait identified on the cited institutional profile.}
{width=240}
Back to article page
