skip to main content
Volume 71, Issue 3June 2024Current Issue
Bibliometrics
Skip Table Of Content Section
INVITED ARTICLE: Distributed Computing
research-article
Smoothed Analysis of Information Spreading in Dynamic Networks
Article No.: 17, Pages 1–24https://doi.org/10.1145/3661831

The best known solutions for k-message broadcast in dynamic networks of size n require Ω (nk) rounds. In this article, we see if these bounds can be improved by smoothed analysis. To do so, we study perhaps the most natural randomized algorithm for ...

SECTION: Complexity Theory
research-article
Local Proofs Approaching the Witness Length
Article No.: 18, Pages 1–42https://doi.org/10.1145/3661483

Interactive oracle proofs (IOPs) are a hybrid between interactive proofs and PCPs. In an IOP, the prover is allowed to interact with a verifier (like in an interactive proof) by sending relatively long messages to the verifier, who in turn is only allowed ...

SECTION: Sequential Decision Making
research-article
Smoothed Analysis with Adaptive Adversaries
Article No.: 19, Pages 1–34https://doi.org/10.1145/3656638

We prove novel algorithmic guarantees for several online problems in the smoothed analysis model. In this model, at each time step an adversary chooses an input distribution with density function bounded above pointwise by \(\tfrac{1}{\sigma }\) times ...

    SECTION: Quantum Complexity and Quantum Cryptography
    research-article
    Open Access
    Verifiable Quantum Advantage without Structure
    Article No.: 20, Pages 1–50https://doi.org/10.1145/3658665

    We show the following hold, unconditionally unless otherwise stated, relative to a random oracle:

    • There are NP search problems solvable by quantum polynomial-time (QPT) machines but not classical probabilistic polynomial-time (PPT) machines.
    • There ...

    SECTION: Structural Graph Theory
    research-article
    Twin-Width IV: Ordered Graphs and Matrices
    Article No.: 21, Pages 1–45https://doi.org/10.1145/3651151

    We establish a list of characterizations of bounded twin-width for hereditary classes of totally ordered graphs: as classes of at most exponential growth studied in enumerative combinatorics, as monadically NIP classes studied in model theory, as classes ...

    SECTION: Algebraic Complexity
    research-article
    Fast Multivariate Multipoint Evaluation over All Finite Fields
    Article No.: 22, Pages 1–32https://doi.org/10.1145/3652025

    Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work, we show that there exists a deterministic algorithm for multivariate ...

    SECTION: Cryptography, Cryptoanalysis
    research-article
    Open Access
    Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
    Article No.: 23, Pages 1–41https://doi.org/10.1145/3653014

    An average-case variant of the k-SUM conjecture asserts that finding k numbers that sum to 0 in a list of r random numbers, each of the order rk, cannot be done in much less than \(r^{\lceil k/2 \rceil }\) time. However, in the dense regime of ...

    SECTION: Algorithms
    research-article
    Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts
    Article No.: 24, Pages 1–55https://doi.org/10.1145/3653446

    It is a fundamental problem to understand the complexity of high-accuracy sampling from a strongly log-concave density π on ℝd. Indeed, in practice, high-accuracy samplers such as the Metropolis-adjusted Langevin algorithm (MALA) remain the de facto gold ...

    Subjects

    Comments