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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 3
Hlavný autor:	Williams, R. Ryan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 29.06.2021
Predmet:	Computational complexity Computer science Systematics Task analysis
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!