.png)
.png)
Vadim V. Lozin, Associate Professor, University of Warwick, Inglaterra
5 de novembro de 2014
Resumo - Slides
The satisfiability problem is known to be NP-complete in general and for many restricted instances, such as formulas with at most 3 variables per clause and at most 3 occurrences per variable, or planar formulas. The latter example refers to graphs representing satisfiability instances. These are bipartite graphs with vertices representing clauses and variables, and edges connecting variables to the clauses containing them.
Finding the strongest possible restrictions under which the problem remains NP-complete is important for at least two reasons. First, this can make it easier to establish the NP-completeness of new problems by allowing easier transformations. Second, this can help clarify the boundary between tractable and intractable instances of the problem. In this talk, we address the second issue and reveal the first boundary property of graphs representing satisfiability instances
Biografia resumida
Vadim Lozin received his Ph.D. in Theoretical Computer Science in 1995 from the University of Nizhny Novgorod, Russia. In 2000, he moved to Rutgers University (USA) and in 2007, to the University of Warwick (UK), where he now is an Associate Professor (Reader) of Mathematics. He also held a number of short-term visiting academic positions in Sweden, Portugal, Switzerland, Canada, Germany, Saudi Arabia, France. He is an author of more than 100 publications in the area of Discrete Mathematics and Theoretical Computer Science. Six Ph.D. students defended their dissertations under the direction of Vadim Lozin. He is an Associate Editor of the journal "Discrete Applied Mathematics", Managing Editor of the journal "Electronic Notes in Discrete Mathematics", and a member of the editorial board of the journal "Discussiones Mathematicae Graph Theory".
