JRF in Propositional Proof Complexity (Theoretical Computer Science) at IIT Indore
Job Description
IIT Indore’s Department of Computer Science and Engineering is hiring a Junior Research Fellow in theoretical computer science for a three-year ANRF project on optimal lower bounds for propositional proof systems. The project is a natural route into a Ph.D.: the advertisement says the candidate should ideally be ready to pursue one, so the tenure can extend towards its completion.
At a glance
- Position: Junior Research Fellow (1 post)
- Project: Towards optimal lower bounds for Propositional Proof Systems
- Funding: ANRF
- Pay (as stated): Salary + HRA: Rs 4,44,000 in the first two years, Rs 5,04,000 in the last year
- Duration: 3 years
- Apply by: The notice says “Sept 31, 2026”; we list 30 September 2026. Interview: 5 October 2026
Propositional proof complexity asks how long a proof must be to show that a logical formula has no solution. The answers set limits on what SAT solvers and integer linear programming, both widely used in industry, can do efficiently, so lower bounds in this area connect deep theory with practical algorithms.
About the JRF role
- Work on lower bounds for propositional proof systems, a sub-field of theoretical computer science
- Study the limits of logical systems that model combinatorial problems such as SAT solving and integer linear programming
The selected candidate will be encouraged to register for the Ph.D. programme at IIT Indore as per institute norms; if selected, the fellowship will be extended for the Ph.D. duration as per norms. The notice is headed “Draft Advertisement”, leaves the advertisement number blank and is dated 05/08/26, and it gives the last date as “Sept 31, 2026”, a date that does not exist, so apply by 30 September to be safe.
Eligibility
- B.Tech or equivalent in Computer Science or ECE
- Desirable: M.Tech or equivalent in Computer Science
No TA/DA is paid for attending the interview, and only shortlisted candidates are called. Selected candidates will be informed by email.
Pay and duration
- Salary + HRA: Rs 4,44,000 in the first two years and Rs 5,04,000 in the last year (as stated on the notice)
- Duration: 3 years
How to apply
Email a detailed CV together with all relevant degree certificates, mark sheets, GATE qualifying certificates and proof of date of birth, in a single PDF, to sasankm@iiti.ac.in.
Key dates
- Applications close: “Sept 31, 2026” on the notice (treat 30 September 2026 as the last safe day)
- Interview: 5 October 2026
Please read the official IIT Indore advertisement (PDF) before applying, and browse more JRF positions on ResearchJobs.in.
Hiring institution: Indian Institute of Technology Indore
Official advertisement: www.iiti.ac.in
How to prepare for this application
- Proof systems: revise resolution, cutting planes and what a proof system is formally.
- Complexity basics: NP, coNP, and why superpolynomial proof lower bounds relate to NP versus coNP.
- SAT solving: how CDCL solvers relate to resolution proofs.
- Mathematical maturity: practise combinatorics and discrete probability problems; theory interviews often use them.
- Ph.D. intent: the project prefers someone ready to do a Ph.D., so say clearly why theory research appeals to you.
About IIT Indore
IIT Indore was established in 2009 and has its campus at Simrol, on Khandwa Road outside Indore, Madhya Pradesh. Its Research and Development section handles externally funded projects like this one, which regularly recruit JRFs, SRFs and research associates.
