Gregory Emdin

Email: egd3700@mail.ru
Website:
Link to CV: https://drive.google.com/file/d/15xdut-MaZTShkH76C4Tq6uksMsT42LUc/view?usp=sharing
Level: PhD, MS, Research Visit
Keywords: Algorithms, computer science, combinatorics, lower bounds, boolean circuits
Short bio / research interests / publications: I’m a final year undergraduate student at Saint Petersburg State University looking for a magistracy or phd position in theoretical computer science. The areas of my research interest include algorithms, complexity, and combinatorics. Currently I’m working at St.Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences, on development CircuitSat solver. We are now close to publishing a paper about lower bound for CNF encodings of parity function (https://arxiv.org/abs/2203.01082).