Project description

Third-cycle subject: Computer Science

The successful candidate for this position joins the Algorithms and Complexity group in the department of Theoretical Computer Science. We welcome motivated applicants with a strong background in theoretical computer science and mathematics, who are interested in exploring and understanding the fundamental nature of efficient computation.

The project will initially focus on Promise Constraint Satisfaction Problems (PCSPs), a rapidly developing area at the intersection of complexity theory, algebra, and combinatorics. Beyond this initial direction, the position is broad and flexible, allowing the student to explore a wide range of topics within computational complexity theory depending on interests and evolving research directions.

Supervision: Elena Troubitsyna and Per Austrinare proposed to supervise the doctoral student. Decisions are made on admission

Admissio...