We invite applications for a *fully funded PhD position* in *computational
complexity theory*, jointly supervised by *Dr. Swagato Sanyal* and *Prof.
Or Meir *at *the University of Sheffield, UK.*
The project will study open questions in computational complexity theory,
more specifically in Boolean function analysis, query complexity,
communication complexity, and circuit complexity. The specific questions to
be studied will be determined jointly with the student to suit their
interests.
The position is expected to start in *February - April 2026*.
The application deadline is *January 31, 2026.*
Further details and application instructions can be found here:
https://www.findaphd.com/phds/project/computational-complexity-theory/?p193336
Please feel free to circulate this announcement to interested students. Any
enquiries may be sent to swagato.sanyal@sheffield.ac.uk
Best regards,
*Swagato Sanyal*
*Lecturer, University of Sheffield*
**********************************************************
*
* 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/
*
**********************************************************
Posts
