The project is on the interface of three very active areas of research in theoretical computer science and mathematics; The first one deals with polynomial ideals and their properties and goes all the way back to David Hilbert; The second one is a widely used tool in complexity, algebraic and semi-algebraic proof systems such as Sum-of-Squares (SoS), where the main question is when a proof of a certain property of a polynomial can be efficiently found; The third area is the analysis of the complexity of constraint satisfaction problems (CSPs), mainly through the universal-algebraic approach
Requirements:
PhD candidates should hold (or be close to obtaining) a Master Degree in Computer Science or related areas. A solid background in Algorithms, Computational Complexity, Discrete Mathematics, Mathematical Programming is helpful. PostDoc candidates should hold (or be close to obtaining) a Ph.D. in Computer Science or related areas
Text:
Ph.D. and PostDoc positions in Algorithms The project is on the interface of three very active areas of research in theoretical computer science and mathematics; The first one deals with polynomial ideals and their properties and goes all the way back to David Hilbert; The second one is a widely used tool in complexity, algebraic and semi-algebraic proof systems such as Sum-of-Squares (SoS), where the main question is when a proof of a certain property of a polynomial can be efficiently found; The third area is the analysis of the complexity of constraint satisfaction problems (CSPs), mainly through the universal-algebraic approach PhD candidates should hold (or be close to obtaining) a Master Degree in Computer Science or related areas. A solid background in Algorithms, Computational Complexity, Discrete Mathematics, Mathematical Programming is helpful. PostDoc candidates should hold (or be close to obtaining) a Ph.D. in Computer Science or related areas
Please click here, if the job didn't load correctly.
Please wait. You are being redirected to the job in 3 seconds.
