Algorithm Design Complexity

Research Frontiers in Lower Bounds from Branching Programs

Investigation of computational lower bounds derived from branching program complexity and width measures.

All Algorithm Design & Complexity PhD categories