Search Results - F.2.0 [Analysis of Algorithms and Problem Complexity

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    Cover Image

    Tight Polynomial Bounds for Loop Programs in Polynomial Space by Ben-Amram, A. M., Hamilton, G. W.

    ISSN: 1860-5974, 1860-5974
    Published: Logical Methods in Computer Science e.V 01.01.2021
    Published in Logical methods in computer science (01.01.2021)
    “… While their computability has been settled, the complexity of this program-analysis problem remained open…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    On Matrix Rigidity and Locally Self-correctable Codes by Dvir, Zeev

    ISSN: 1016-3328, 1420-8954
    Published: Basel SP Birkhäuser Verlag Basel 01.06.2011
    Published 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…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: