Uploaded September 2026 | Updated November 2026, 2 days ago
Program: Circuits, Communication, and Proofs
ORGANIZERS: Arkadev Chattopadhyay (TIFR, Mumbai, India) and Meena Mahajan (IMSc, Chennai, India)
DATE & TIME: 10 August 2026 to 21 August 2026
VENUE: Ramanujan Lecture Hall, ICTS Bengaluru
Theoretical computer science in general, and computational complexity theory in particular, offers a new lens to look at the other natural and mathematical sciences, and is having a significant impact in those other fields. The main goal of computational complexity theory is the study of the (in)feasibility of efficient computation. Proof complexity, originating from mathematical logic, examines the strength of logical reasoning approaches rather than directly reasoning with computation. The Cook-Reckhow program aims to ultimately show that in every propositional proof system, there exist true statements that do not have short efficiently verifiable proofs; this is equivalent to separating NP from coNP, an even harder problem than the notorious P=?NP problem. The modern networked world with shared resources drives home the point that both computation and communication are equally valued resources. Complexity theorists have increasingly realized that the study of communication bottlenecks, in a simple model proposed by Yao 40 years ago, often holds the key to proving the non-existence of efficient algorithms. This happens in a remarkable variety of situations.
The strands of circuit complexity, query/communication complexity, and proof complexity have a lot to offer each other in terms of tools, techniques, and questions. In the last decade, the interplay between these strands has really flourished – communication complexity theoretic techniques have been heavily used in propositional proof complexity; lower bounds on the sizes of proofs, via communication complexity arguments, have implied lower bounds on size of monotone circuits; lifting theorems have allowed non-trivial transfer of lower bounds across models, etc.
In this 2-week program, the first week will be in the form of a boot camp, with a series of lectures on each of the three strands mentioned above. The second week will feature research talks, giving participants exposure to current developments in the areas.
CONTACT US: ccproofs@icts.res.in
PROGRAM LINK: icts.res.in/program/ccp
Program: Circuits, Communication, and Proofs
ORGANIZERS: Arkadev Chattopadhyay (TIFR, Mumbai, India) and Meena Mahajan (IMSc, Chennai, India)
DATE & TIME: 10 August 2026 to 21 August 2026
VENUE: Ramanujan Lecture Hall, ICTS Bengaluru
Theoretical computer science in general, and computational complexity theory in particular, offers a new lens to look at the other natural and mathematical sciences, and is having a significant impact in those other fields. The main goal of computational complexity theory is the study of the (in)feasibility of efficient computation. Proof complexity, originating from mathematical logic, examines the strength of logical reasoning approaches rather than directly reasoning with computation. The Cook-Reckhow program aims to ultimately show that in every propositional proof system, there exist true statements that do not have short efficiently verifiable proofs; this is equivalent to separating NP from coNP, an even harder problem than the notorious P=?NP problem. The modern networked world with shared resources drives home the point that both computation and communication are equally valued resources. Complexity theorists have increasingly realized that the study of communication bottlenecks, in a simple model proposed by Yao 40 years ago, often holds the key to proving the non-existence of efficient algorithms. This happens in a remarkable variety of situations.
The strands of circuit complexity, query/communication complexity, and proof complexity have a lot to offer each other in terms of tools, techniques, and questions. In the last decade, the interplay between these strands has really flourished – communication complexity theoretic techniques have been heavily used in propositional proof complexity; lower bounds on the sizes of proofs, via communication complexity arguments, have implied lower bounds on size of monotone circuits; lifting theorems have allowed non-trivial transfer of lower bounds across models, etc.
In this 2-week program, the first week will be in the form of a boot camp, with a series of lectures on each of the three strands mentioned above. The second week will feature research talks, giving participants exposure to current developments in the areas.
CONTACT US: ccproofs@icts.res.in
PROGRAM LINK: icts.res.in/program/ccp








![Turbulence Theory by Ozgur Gurcan
Program: Plasma Turbulence: New Challenges from Magnetic Confinement
ORGANIZERS: Amita Das (Indian Institute of Technology Delhi, India), Patrick Diamond (University of California, San Diego, USA), David Hughes (University of Leeds, Leeds, UK) and Rahul Pandit (Indian Institute of Science, Bengaluru, India)
DATE & TIME: 24 August 2026 to 28 August 2026
VENUE: Ramanujan Lecture Hall, ICTS, Bengaluru
The delivery of clean and abundant electrical power from nuclear fusion reactors continues to be a major challenge. The conventional approaches advocate the development of large tokamaks, the best example of which is ITER, the world’s largest fusion experiment, on which 35 nations (including nations in the EU, India, Japan, UK, and USA) are collaborating [see, e.g., https://www.iter.org/ and https://fusionforenergy.europa.eu/], and laser-driven inertial confinement fusion [see, e.g., https://lasers.llnl.gov/news/fusion-ignition-and-the-path-to-inertial fusion-energy].
However, there is a growing complementary movement to develop smaller, more cost-effective fusion reactors, including spherical tokamaks (ST). Some important examples of these are:
1. USA:SPARC, at Commonwealth Fusion Systems (https://cfs.energy/technology/sparc) – in part derivative from the ALCATOR Program (A,C,C-Mod) at the Plasma Science and Fusion Center, MIT (https://www.psfc.mit.edu/sparc); see also: USA: Helion (https://www.helionenergy.com/);
2. UK: Mega Ampere Spherical Tokamak [MAST-U] (https://ccfe.ukaea.uk/programmes/mast-upgrade/); to be followed by STEP (Spherical Tokamak Energy Production). See also NSTX-U in USA;
3. China: BEST – anticipated next step after EAST – Experimental Advanced Superconducting Tokamak ( http://east.ipp.ac.cn/).
Several articles in the press have written about recent investments in commercial fusion. These small-fusion-reactor developments have been driven, in part, by the rapidly growing demand for electrical power in many industries, especially for AI. Loosely speaking, these compact devices fall into two categories: high-field, high-density tokamaks (SPARC, BEST), and spherical tokamaks (MAST-U, NSTX-U, STEP), which are typically high(er) β (with the plasma β = plasma pressure/magnetic pressure) than conventional tokamaks. A common issue for all compact devices is boundary control, as their small size leads to high power fluxes impinging on the plasma-facing component (PFC) surfaces.
Given these developments, it behooves us to examine new theoretical problems that are emerging in this area. In particular, design and technological challenges drive important and fundamental questions in plasma-turbulence theory. Indeed, the challenges of compact devices might well turn out to be more demanding than those that have been confronted while designing ITER. Good confinement alone is not sufficient. Turbulence control and optimization are required to achieve both good confinement and satisfactory power handling. The time is ripe, therefore, to bring together fusion scientists with researchers in turbulence theory and modeling from all parts of the world. ICTS is a logical venue, as India is a participant in ITER and has a significant number of experts in plasma theory, fluid dynamics, and turbulence. This Workshop at the ICTS will explore New Challenges from Magnetic Confinement.
CONTACT US: ptmc@icts.res.in
PROGRAM LINK: https://icts.res.in/program/ptmc Turbulence Theory by Ozgur Gurcan](https://i.ytimg.com/vi/cLsWlJ523vQ/mqdefault.jpg)

