Deadline: 14 Jan. 2013
KTH School of Computer Science and Communication (CSC) announces a postdoctoral position in Theoretical Computer Science with a focus on proof complexity and connections to SAT solving.
AssignmentWe are seeking a postdoctoral researcher in Theoretical Computer Science within the framework of the research project “Understanding the Hardness of Theorem Proving.” This is a project in proof complexity with connections to SAT solving.
Proof complexity studies formal systems for reasoning about logic formulas. This field has deep connections to fundamental questions in computational complexity, but another important motivation is the connection to SAT solving. All SAT solvers use some kind of method or system in which proofs are searched for, and proof complexity analyses the potential and limitations of such proof systems (and thereby of the algorithms using them).
This project aims to advance the frontiers of proof complexity, and to leverage this research to shed light on questions related to SAT solving. We are particularly interested in exploring the possibility of basing SAT solvers on stronger proof systems than are currently being used. In order to do so, however, a crucial step is to obtain a better understanding of the corresponding proof systems, and in this context there are a number of well-known and relatively longstanding open questions in proof complexity that we want to study and try to solve. A more detailed description of the project can be found atwww.csc.kth.se/~jakobn/project-proofcplx.
The project is led by Jakob Nordström ( www.csc.kth.se/~jakobn) and is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. The group currently consists of one postdoctoral researcher and two PhD students (in addition to the project leader). Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the development of the project. Taking part in teaching a graduate seminar course (in proof complexity or neighbouring areas) is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.
This is a full-time employed position for one year with a possible one-year extension. The successful candidate is expected to start at the latest in August-September 2013, although this is to some extent negotiable.
Work time: Full time
Start date: By agreement, but preferably no later than August-September 2013
Number of positions: 1
The successful candidate is expected to have a solid background in Theoretical Computer Science (computational complexity) and Mathematics (in areas such as combinatorics, algebra and/or geometry). Exceptional candidates are always of interest regardless of formal prerequisites. Problem solving skills and creativity are a must.
The working language of the TCS group is English, and knowledge of English is also fully sufficient to navigate life in Sweden in general.
Employer's reference: D-2012-0444
Applications should be sent via email to Kerstin Lagerstedt, jobs@csc.kth.se Write the reference number in the subject line. The application and all attachments should be sent as PDF files.
To receive full consideration, the application should be received by January 14, 2013. Applications will be reviewed until the position has been filled.
Applications should include the following documents:
We are currently gathering information to help improve our recruitment process. We would therefore be very grateful if you could include an answer to the following question in your application: Where did you initially come across this job advertisement?
Proof complexity studies formal systems for reasoning about logic formulas. This field has deep connections to fundamental questions in computational complexity, but another important motivation is the connection to SAT solving. All SAT solvers use some kind of method or system in which proofs are searched for, and proof complexity analyses the potential and limitations of such proof systems (and thereby of the algorithms using them).
This project aims to advance the frontiers of proof complexity, and to leverage this research to shed light on questions related to SAT solving. We are particularly interested in exploring the possibility of basing SAT solvers on stronger proof systems than are currently being used. In order to do so, however, a crucial step is to obtain a better understanding of the corresponding proof systems, and in this context there are a number of well-known and relatively longstanding open questions in proof complexity that we want to study and try to solve. A more detailed description of the project can be found atwww.csc.kth.se/~jakobn/project-proofcplx.
The project is led by Jakob Nordström ( www.csc.kth.se/~jakobn) and is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. The group currently consists of one postdoctoral researcher and two PhD students (in addition to the project leader). Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the development of the project. Taking part in teaching a graduate seminar course (in proof complexity or neighbouring areas) is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.
This is a full-time employed position for one year with a possible one-year extension. The successful candidate is expected to start at the latest in August-September 2013, although this is to some extent negotiable.
Employment
Form of employment: One year temporary position with a possible one-year extensionWork time: Full time
Start date: By agreement, but preferably no later than August-September 2013
Number of positions: 1
Qualifications
Applicants should have or be about to receive a PhD degree in a subject relevant for the research area, such as Computer Science or Mathematics (preferably focused on proof complexity or neighbouring areas), and should have a passionate interest in research.The successful candidate is expected to have a solid background in Theoretical Computer Science (computational complexity) and Mathematics (in areas such as combinatorics, algebra and/or geometry). Exceptional candidates are always of interest regardless of formal prerequisites. Problem solving skills and creativity are a must.
The working language of the TCS group is English, and knowledge of English is also fully sufficient to navigate life in Sweden in general.
Application
Application deadline: January 14, 2013.Employer's reference: D-2012-0444
Applications should be sent via email to Kerstin Lagerstedt, jobs@csc.kth.se Write the reference number in the subject line. The application and all attachments should be sent as PDF files.
To receive full consideration, the application should be received by January 14, 2013. Applications will be reviewed until the position has been filled.
Applications should include the following documents:
- Curriculum vitae
- List of publications
- Brief research statement with description of professional interests and goals in research
- Copy of PhD diploma (if applicable)
- Names and addresses of three or more individuals who will provide letters of recommendation
We are currently gathering information to help improve our recruitment process. We would therefore be very grateful if you could include an answer to the following question in your application: Where did you initially come across this job advertisement?
No comments:
Post a Comment