ProfessorIddo Tzameret

My research lies broadly in the theory of computing, algorithms and complexity. I'm exploring the limits of efficient computation and inference, both as a natural and a mathematical phenomenon. This includes computational and proof complexity, satisfiability, algebraic, logical and combinatorial approaches in complexity, and the theory of SAT- and constraint-solving. Find out more about my research in my publication page; see also this survey.