Výsledky vyhledávání - F.2.0 [Analysis of Algorithms and Problem Complexity
-
1
Tight Polynomial Bounds for Loop Programs in Polynomial Space
ISSN: 1860-5974, 1860-5974Vydáno: Logical Methods in Computer Science e.V 01.01.2021Vydáno v Logical methods in computer science (01.01.2021)“… While their computability has been settled, the complexity of this program-analysis problem remained open…”
Získat plný text
Journal Article -
2
On Matrix Rigidity and Locally Self-correctable Codes
ISSN: 1016-3328, 1420-8954Vydáno: Basel SP Birkhäuser Verlag Basel 01.06.2011Vydáno v Computational complexity (01.06.2011)“… ), and the problem of proving lower bounds for linear locally correctable codes. Our result shows that proving linear lower bounds on locally correctable codes with super-logarithmic query complexity will give new constructions of rigid matrices…”
Získat plný text
Journal Article