PDRA in Algorithms and Hardness for Tarski and Banach Fixed Point Problems
- Location
- Liverpool, England, United Kingdom
computational complexity lower bounds with a particular focus on the complexity class UEOPL. An ideal candidate will have a strong background in Theoretical Computer Science and an enthusiasm for working on these problems. The candidate will also have, or be close to completing, a PhD in Computer Science or a related area. If you are still awaiting your PhD to be awarded you will be appointed at Grade 6, spine point 30. Upon written confirmation that you have been awarded your PhD, your salary will be increased to Grade 7, spine point 31. Our commitment ...