[Proof Complexity] PhD Positions at Imperial College London in Complexity (deadline: 8th Dec 2021)

Iddo Tzameret iddo.tzameret at gmail.com
Sun Oct 24 09:01:00 CEST 2021


 Dear Colleagues,

I have at least one fully funded PhD studentships in computational and
proof complexity in my group <https://ccag.doc.ic.ac.uk/> at Imperial
College London in the context
of an ERC grant. See more details below. Anyone who is interested is more
than welcome to inquire about this post via email (if you know of anyone
who may be interested, please let them know of course).

Best wishes,
--- Iddo Tzameret


************************************************************
 PHD STUDENTSHIPS IN COMPUTATIONAL COMPLEXITY
 IMPERIAL COLLEGE LONDON
************************************************************

FULLY FUNDED PHD POSITIONS (of any nationality)
CLOSING DATE FOR APPLICATIONS: *8th December 2021* (by midnight UK time)
START DATE: 2022 (flexible)
SIMPLIFIED (INITIAL) APPLICATION PROCESS:
Just drop me (iddo.tzameret at gmail.com) an email with your CV attached,
together with a couple of words describing if and what you know about the
theory of computing (normally undergrad level; e.g., a course you took).

----------------------
Imperial's complexity group <https://ccag.doc.ic.ac.uk/> led by Iddo
Tzameret <https://www.doc.ic.ac.uk/~itzamere/> is seeking
mathematically oriented 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
topics normally revolve around fundamental lower bound questions
in computational complexity.

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. We have specific close ties, including
joint seminars, etc. with the complexity groups at Oxford and
Warwick universities.

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 normally have an M.Sc. (or equivalent) in an
area pertinent to the subject area, ideally computer science or
mathematics (with some background in the theory of computing).
Imperial requires distinction in bachelor's degree or master's degree
(scaled to the academic system at hand; this is a formal requirement
that can be waived in special cases such as prior publication record
in the relevant area).


For further information about the project and group, see my homepage
<https://www.doc.ic.ac.uk/~itzamere/>
and publications <https://www.doc.ic.ac.uk/~itzamere/Pub.html>, and
https://www.doc.ic.ac.uk/~itzamere/siglog.pdf for
a survey about some problems that interest me, the group website
<https://ccag.doc.ic.ac.uk/>,
or email: iddo.tzameret at gmail.com (candidates will have
freedom to pursue their own research agenda assuming it aligns
with that of the group). For information about Imperial's PhD formal
application
process see:
https://www.imperial.ac.uk/computing/prospective-students/courses/phd/phd-application-guidelines/


HOW TO APPLY

To be considered, candidates should simply send their full CV to
iddo.tzameret at gmail.com, and explain very briefly if and what they
know about the theory of computing (e.g., an undergrad course they took).

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


--
Professor Iddo Tzameret
Chair in Computational Complexity
Department of Computing
Imperial College London
e-mail: iddo.tzameret at gmail.com
For internal College matters: itzamere at ic.ac.uk
Homepage: https://www.doc.ic.ac.uk/~itzamere/
Group: https://ccag.doc.ic.ac.uk/


More information about the Proof-Complexity mailing list