The field of exact exponential time algorithms for non-deterministic polynomial-time hard
problems has thrived since the mid-2000s. While exhaustive search remains asymptotically …

We introduce graph motif parameters, a class of graph parameters that depend only on the
frequencies of constant-size induced subgraphs. Classical works by Lovász show that many …

Quantum computational supremacy arguments, which describe a way for a quantum
computer to perform a task that cannot also be done by a classical computer, typically …

Reinforcement learning with function approximation has recently achieved tremendous
results in applications with large state spaces. This empirical success has motivated a …

A fundamental question in reinforcement learning theory is: suppose the optimal value
functions are linear in given features, can we learn them efficiently? This problem's …

We present functions that can be computed in some fixed polynomial time but are hard on
average for any algorithm that runs in slightly smaller time, assuming widely-conjectured …

One of the main milestones in quantum information science is to realise quantum devices
that exhibit an exponential computational advantage over classical ones without being …

Many results in fine-grained complexity reveal intriguing consequences from solving various
SAT problems even slightly faster than exhaustive search. We prove a “self-improving”(or …

This paper presents a review of online systems for content-based medical image retrieval
(CBIR). The objective of this review is to evaluate the capabilities and gaps in these systems …

For the General Factor problem we are given an undirected graph $ G $ and for each vertex
$ v\in V (G) $ a finite set $ B_v $ of non-negative integers. The task is to decide if there is a …