In this paper we develop a new algorithm for deciding the winner in parity games, and hence
also for the modal μ-calculus model checking. The design and analysis of the algorithm is …

A theory of resource-bounded dimension is developed using gales, which are natural
generalizations of martingales. When the resource bound Δ (a parameter of the theory) is …

Classical fractal dimensions (Hausdorff dimension and packing dimension) have recently
been effectivized by (i) characterizing them in terms of real‐valued functions called gales …

A hybrid algorithm is a collection of heuristics, paired with a polynomial time selector S that
runs on the input to decide which heuristic should be executed to solve the problem. Hybrid …

Under the hypothesis that NP has positive p-dimension, we prove that any approximation
algorithm A for MAX3SAT must satisfy at least one of the following: 1. For some¿ 0, A uses at …

Comparing reductions to NP-complete sets Page 1 Information and Computation 205 (2007)
694–706 www.elsevier.com/locate/ic Comparing reductions to NP-complete sets John M …

We consider three complexity-theoretic hypotheses that have been studied in different
contexts and shown to have many plausible consequences.–The Measure Hypothesis: NP …

We establish a relationship between the online mistake-bound model of learning and
resource-bounded dimension. This connection is combined with the Winnow algorithm to …

Derandomization techniques are used to show that at least one of the following holds
regarding the size of the counting complexity class SPP: In other words, SPP is small by …

This paper investigates the existence of inseparable disjoint pairs of NP languages and
related strong hypotheses in computational complexity. Our main theorem says that, if NP …