Algorithm Design Complexity

Research Frontiers in Complexity Lower Bounds via Algebraic Methods

This category explores fundamental algorithmic lower bounds using algebraic techniques such as polynomial method, tensor rank arguments, and algebraic complexity theory.

All Algorithm Design & Complexity PhD categories