Suchergebnisse - f.2.0[analysis of algorithms and (problem OR problems) complexity
-
1
Tight Polynomial Bounds for Loop Programs in Polynomial Space
ISSN: 1860-5974, 1860-5974Veröffentlicht: Logical Methods in Computer Science e.V 01.01.2021Veröffentlicht in Logical methods in computer science (01.01.2021)“… While their computability has been settled, the complexity of this program-analysis problem remained open …”
Volltext
Journal Article -
2
On Matrix Rigidity and Locally Self-correctable Codes
ISSN: 1016-3328, 1420-8954Veröffentlicht: Basel SP Birkhäuser Verlag Basel 01.06.2011Veröffentlicht in 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 …”
Volltext
Journal Article