Complexity Lower Bounds from Algorithm Design

Since the beginning of the theory of computation, researchers have been fascinated by the prospect of proving impossibility results on computing. When and how can we argue that a task cannot be efficiently solved, no matter what algorithm we try to use?In this short article, I will briefly introduce...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 3
Main Author:	Williams, R. Ryan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Computational complexity Computer science Systematics Task analysis
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!