One of the more significant achievements of twentieth century mathematics, especially from
the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in …

A basic issue in computer science is the complexity of problems. Computational complexity
measures how much time or memory is needed as a function of the input problem size …

Random walks, universal traversal sequences, and the complexity of maze problems Toggle
navigation IEEE Computer Society Digital Library Jobs Tech News Resource Center Press …

The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel
with a feasible (polynomial) number of processors. Many natural problems in NC are known; …

This is the second volume of a two volume collection on Structural Complexity. This volume
assumes as a prerequisite knowledge about the topics treated in Volume I, but the present …

Publisher Summary This chapter discusses the concepts needed for defining the complexity
classes. A complexity class is a set of problems of related resource-based complexity. A …

This paper continues the investigation of the connection between probabilistically checkable
proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on …

We consider the complexity of several standard problems for various classes of Petri nets. In
particular, the reachability problem, the liveness problem and the k-boundedness problems …

Computability and complexity theory should be of central concern to practitioners as well as
theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal …

A parallel algorithm is presented that accepts as input a graph G and produces a maximal
independent set of vertices in G. On a P-RAM without the concurrent write or concurrent read …