[DMANET] PhD Studentships in Computational Complexity - Imperial College London

*******************************************************************
PHD STUDENTSHIPS IN COMPUTATIONAL COMPLEXITY
IMPERIAL COLLEGE LONDON
DEPARTMENT OF COMPUTING
*******************************************************************

Two PhD positions (of any nationality)
START DATE: Autumn 2021 (may be flexible)
CLOSING DATE FOR APPLICATIONS: 31st Mar 2021 (by midnight)


Imperial's Computing is seeking up to two strong and motivated
PhD students with a background in Theoretical Computer Science
or Mathematics, interested in computational complexity. The
positions are based at the South Kensington campus at the heart
of London, and include a generous stipend, as well as funding
for equipment and travel. The topic revolves around fundamental
lower bound questions in computational complexity. The
successful candidate will join the complexity group at Imperial
College led by Professor Iddo Tzameret.

Imperial College London Department of Computing is a
world-leading department of computer science which is
consistently ranked among the top computer science departments
in major international league tables.

The PhD will be carried out in the context of a flagship ERC
(European Research Council) funded project EPRICOT (Efficient
Proofs and Computation) which has the goal to push forward the
frontiers of the fundamental questions in computational
complexity theory, such as new lower bounds on concrete
computational models, structure (reductions between different
computational problems) and meta-mathematics of complexity.
However, students will have the freedom to pursue their own
ideas within complexity if they choose so. Apart from generous
funding for equipment and travel covered, the position offers
an exciting opportunity to conduct internationally leading and
impactful basic research in a major computer science department
at the heart of London, with many leading research groups and
other institutions nearby.

Candidates with a firm (undergraduate) background in the
following areas are good fit:

- The theory of computing and computational complexity;
- Knowledge of basic algebra, combinatorics, and possibly logic;
with more advanced experience or knowledge in these areas being
an advantage.


The successful applicant will have an MSc (or equivalent) in an
area pertinent to the subject area, ideally computer science or
mathematics (with some background in the theory of computing).

For further information on the project, see:
https://www.cs.rhul.ac.uk/home/ubac001/index.html, and
http://www.cs.rhul.ac.uk/home/tzameret/siglog.pdf for a survey,
or email: iddo.tzameret@gmail.com (though candidates will have
freedom to pursue their own research agenda assuming it aligns
with that of the group).


HOW TO APPLY

To be considered, candidates should send their full CV to
iddo.tzameret@gmail.com

Informal enquiries related to the position are strongly
encouraged and should be directed to Iddo Tzameret at the above
email.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************