Karp and Lipton introduced advice-taking Turing machines to capture nonuniform
complexity classes. We study this concept for automata-like models and compare it to other …

The Guide to Reliable Distributed Systems: Building High-Assurance Applications and
Cloud-Hosted Services is a heavily edited new edition of a prior edition that went under the …

The hardest problems in the complexity class NP are called NP-complete. However, not all
NP-complete problems are equally hard to solve from the average point of view. For …

Variants of Kannan's Theorem are given where the circuits of the original theorem are
replaced by arbitrary recursively presentable classes of languages that use advice strings …

Numerical relations in logics are known to characterize, via the finite models of their
sentences, polynomial advice nonuniform complexity classes. These are known to coincide …

For a given set of strings, the problem of obtaining a succinct description becomes an
important subject of research, related to several areas of theoretical computer science. In …

In the late nineteen sixties it was observed that the re languages form an infinite proper
hierarchy RE 1⊂ RE 2⊂⋯ based on the size of the Turing machines that accept them. We …

Loveland complexity is a variant of Kolmogorov complexity, where it is asked to output
separately the bits of the desired string, instead of the string itself. Similarly to the resource …

For a given set of strings, the problem of obtaining a succinct description becomes an
important subject of research, related to several areas of theoretical computer science. In …