Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3618260acmconferencesBook PagePublication PagesstocConference Proceedingsconference-collections
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing
ACM2024 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
STOC '24: 56th Annual ACM Symposium on Theory of Computing Vancouver BC Canada June 24 - 28, 2024
ISBN:
979-8-4007-0383-6
Published:
11 June 2024
Sponsors:

Bibliometrics
Skip Abstract Section
Abstract

The papers in this volume were presented at the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Vancouver, Canada, June 24--28, 2024, with the papers being presented as live talks.

SESSION: 1A (Best Papers)
research-article
Free
Single-Source Shortest Paths with Negative Real Weights in Õ(𝑚𝑛8/9) Time

This paper presents a randomized algorithm for single-source shortest paths on directed graphs with real (both positive and negative) edge weights. Given an input graph with n vertices and m edges, the algorithm completes in Õ(mn8/9) time with high ...

research-article
Open Access
Near Optimal Alphabet-Soundness Tradeoff PCPs

We show that for all є>0, for sufficiently large prime power q, for all δ>0, it is NP-hard to distinguish whether a 2-Prover-1-Round projection game with alphabet size q has value at least 1-δ, or value at most 1/q^(1-є). This establishes a nearly ...

research-article
Open Access
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the number of variables, from one where every assignment fails to satisfy an ε ...

Contributors
  • Simon Fraser University
  • Simon Fraser University
  • Carnegie Mellon University

Index Terms

  1. Proceedings of the 56th Annual ACM Symposium on Theory of Computing

    Recommendations

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
    YearSubmittedAcceptedRate
    STOC '153479327%
    STOC '143199129%
    STOC '1336010028%
    STOC '113048428%
    STOC '083258025%
    STOC '032708030%
    STOC '022879132%
    STOC '012308336%
    STOC '001828547%
    STOC '981697544%
    STOC '972117536%
    STOC '962017437%
    STOC '891965629%
    STOC '881925328%
    STOC '871655030%
    STOC '801254738%
    STOC '791113733%
    STOC '781203832%
    STOC '77873136%
    STOC '76833036%
    STOC '75873136%
    STOC '74953537%
    STOC '71502346%
    STOC '70702739%
    Overall4,5861,46932%