ASCEND
BY NTHRYS

NTHRYSPhD AssistanceDiscrete Mathematics

Discrete Mathematics

Field
Category

Discrete Mathematics

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Boolean Function Complexity and Circuit Complexity

Analysis of computational hardness of Boolean functions through circuit complexity, monotone complexity, and communication complexity lower bounds.

All Discrete Mathematics PhD categories