Showing 1 - 19 results of 19 for search 'Williams, R Ryan', query time: 0.05s Refine Results
  1. 1
    Faster All-Pairs Shortest Paths via Circuit Complexity

    Faster All-Pairs Shortest Paths via Circuit Complexity by Williams, R Ryan

    Published 2021
    Get full text
    Article
  2. 2
    Complexity Lower Bounds from Algorithm Design

    Complexity Lower Bounds from Algorithm Design by Williams, R Ryan

    Published 2022
    Get full text
    Article
  3. 3
    From Circuit Complexity to Faster All-Pairs Shortest Paths

    From Circuit Complexity to Faster All-Pairs Shortest Paths by Williams, R Ryan

    Published 2022
    Get full text
    Article
  4. 4
    Self-Improvement for Circuit-Analysis Problems

    Self-Improvement for Circuit-Analysis Problems by Williams, R. Ryan

    Published 2024
    Get full text
    Article
  5. 5
    Faster deterministic and Las vegas algorithms for offline approximate nearest neighbors in high dimensions

    Faster deterministic and Las vegas algorithms for offline approximate nearest neighbors in high dimensions by Alman, Joshua, Williams, R Ryan

    Published 2021
    Get full text
    Article
  6. 6
    Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms

    Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms by Vyas, Nikhil, Williams, R. Ryan

    Published 2021
    Get full text
    Article
  7. 7
    Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma

    Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma by Murray, Cody D, Williams, R Ryan

    Published 2021
    Get full text
    Article
  8. 8
    Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky

    Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky by Chan, Timothy M, Williams, R Ryan

    Published 2022
    Get full text
    Article
  9. 9
    Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP

    Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP by Murray, Cody (Cody Daniel), Williams, R Ryan

    Published 2021
    Get full text
    Article
  10. 10
    Sharp threshold results for computational complexity

    Sharp threshold results for computational complexity by Chen, Lijie, Jin, Ce, Williams, R Ryan

    Published 2022
    Get full text
    Article
  11. 11
    Sharp threshold results for computational complexity

    Sharp threshold results for computational complexity by Chen, Lijie, Jin, Ce, Williams, R Ryan

    Published 2022
    Get full text
    Article
  12. 12
    Hardness Magnification for all Sparse NP Languages

    Hardness Magnification for all Sparse NP Languages by Chen, Lijie, Jin, Ce, Williams, R Ryan

    Published 2021
    Get full text
    Article
  13. 13
    Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic

    Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic by Ilango, Rahul, Li, Jiatu, Williams, R. Ryan

    Published 2023
    Get full text
    Article
  14. 14
    Beating Brute Force for Compression Problems

    Beating Brute Force for Compression Problems by Hirahara, Shuichi, Ilango, Rahul, Williams, R. Ryan

    Published 2024
    Get full text
    Article
  15. 15
    Constructive Separations and Their Consequences

    Constructive Separations and Their Consequences by Chen, Lijie, Jin, Ce, Santhanam, Rahul, Williams, R Ryan

    Published 2022
    Get full text
    Article
  16. 16
    Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes

    Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes by McKay, Dylan M., Murray, Cody D., Williams, R. Ryan

    Published 2021
    Get full text
    Article
  17. 17
    A Dual Perspective on Computational Complexity

    A Dual Perspective on Computational Complexity by Chapman, Brynmor

    Published 2023
    Other Authors: “…Williams, R. Ryan…”
    Get full text
    Get full text
    Thesis
  18. 18
    Satisfiability Algorithms and Connections between Algorithms and Circuit Lower Bounds

    Satisfiability Algorithms and Connections between Algorithms and Circuit Lower Bounds by Vyas, Nikhil

    Published 2023
    Other Authors: “…Williams, R. Ryan…”
    Get full text
    Get full text
    Thesis
  19. 19
    Toward improved non-interactive proof systems

    Toward improved non-interactive proof systems by Kwon, Sophia Seoyoung

    Published 2023
    Other Authors: “…Williams, R. Ryan…”
    Get full text
    Thesis

Search Tools: