University of Oxford

Open Data about the University of Oxford

data.ox.ac.uk

beta

Research Associate in Computational Complexity Theory and Proof Complexity

Applications for this vacancy closed on 25 June 2018 at 12:00PM
<div xmlns="http://www.w3.org/1999/xhtml"> <p></p><p>The Department of Computer Science is looking for a full-time Research Associate in computational complexity theory and proof complexity for a period of 6 months. You will be working with Professor Rahul Santhanam on an ERC Consolidator Grant research project ALUnif: &#145;Algorithms and Lower Bounds: A Unified Approach&#146;.</p><br> <p>Recent work on the project has had an emphasis on the minimum circuit size problem, a fundamental problem in circuit lower bounds, learning theory, cryptography and proof complexity. There is a particular need for a researcher on the project with strengths in proof complexity and computational complexity to build on the work that has been done so far. You will collaborate with the PI and your colleagues in the research team to investigate connections between proof complexity and computational complexity that involve the minimum circuit size problem and its variants.</p><br> <p>You will hold a PhD/DPhil (or be close to completion) in computer science or related discipline, possess specialist knowledge in computational complexity and proof complexity, have previous experience of contributing to publications, and the ability to manage your own academic research and activities. Experience of actively collaborating in the development of research articles for publication, or of independently managing a discrete area of a research project are highly desirable.</p><br> <p>The closing date for applications is 12.00 noon on 25 June 2018.</p><br> <p>Our staff and students come from all over the world and we proudly promote a friendly and inclusive culture. Diversity is positively encouraged, through diversity groups and champions, for example http://www.cs.ox.ac.uk/aboutus/women-cs-oxford/index.html, as well as a number of family-friendly policies, such as the right to apply for flexible working and support for staff returning from periods of extended absence, for example maternity leave.</p> </div>
dc:spatial
Department of Computer Science, Wolfson Building, Parks Road, Oxford.
Subject
oo:contact
oo:formalOrganization
oo:organizationPart
vacancy:applicationClosingDate
2018-06-25 12:00:00+01:00
vacancy:applicationOpeningDate
2018-06-18 09:00:00+01:00
vacancy:furtherParticulars
vacancy:internalApplicationsOnly
False
vacancy:salary
type
comment

The Department of Computer Science is looking for a full-time Research Associate in computational complexity theory and proof complexity for a period of 6 months. You will be working with Professor Rahul Santhanam on an ERC Consolidator Grant research project ALUnif: ‘Algorithms and Lower Bounds: A Unified Approach’.


Recent work on the project has had an emphasis on the minimum circuit size problem, a fundamental problem in circuit lower bounds, learning theory, cryptography and proof complexity. There is a particular need for a researcher on the project with strengths in proof complexity and computational complexity to build on the work ...

The Department of Computer Science is looking for a full-time Research
Associate in computational complexity theory and proof complexity for a period
of 6 months. You will be working with Professor Rahul Santhanam on an ERC
Consolidator Grant research project ALUnif: ‘Algorithms and Lower Bounds: A
Unified Approach’.



Recent work on the project has had an emphasis on the minimum circuit size
problem, a fundamental problem in circuit lower bounds, learning theory,
cryptography and proof complexity. There is a particular need for a researcher
on the project with strengths in proof complexity and computational complexity
to build on the work ...
label
Research Associate in Computational Complexity Theory and Proof Complexity
notation
135584
based near
page