Discover here more job vacancies on academics – the leading job market for science and research. In order to receive information about suitable job vacancies regularly by email, you can register with us free of charge at any time.
KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.
Salary group Monthly salary incl. pension & social security benefits
Reference number D-2016-0833
The Ph.D. student will be working in the research group of Jakob Nordstrom. Much of the activities of this research group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL). We are even more interested in exploring new techniques that hold out the theoretical possibility of exponential improvements over CDCL, but seem hard to implement efficiently in practice, e.g., algebraic methods such as Groebner bases or geometric methods such as pseudo-Boolean solving (basically 0/1 integer linear programming).
The research project is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx. The group currently consists of two postdoctoral researchers and four Ph.D. students (in addition to the PI). There are also several other professors, postdocs, and Ph.D. students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is a unique opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.
This is a four-year full-time employed position, but Ph.D. positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate is expected to start at the latest in August-September 2017, although this is to some extent negotiable. The position is fully funded and comes with a competitive salary.
How to apply
The application deadline is January 15, 2017. See http://www.csc.kth.se/~jakobn/openings/D-2016-0833-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to email@example.com.
KTH Royal Institute of Technology