NTHRYS › PhD Assistance › Discrete Mathematics
Select a category to explore research frontiers
Loading categories...
Analysis of computational hardness of Boolean functions through circuit complexity, monotone complexity, and communication complexity lower bounds.
All Discrete Mathematics PhD categories