Valentine Kabanets

1. The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
   2007/06/14 by Chris Calabro, Russell Impagliazzo, Valentine Kabanets +1 · 5 citations
   Computer Science · #Constraint Satisfaction and Optimization #semigroups and automata theory #Logic, Reasoning, and Knowledge
2. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
   2004/12/01 by Valentine Kabanets, Russell Impagliazzo · 3 citations
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Machine Learning and Algorithms