Search filters

List of works by Stephen Cook

A hierarchy for nondeterministic time complexity

A taxonomy of problems with fast parallel algorithms

scholarly article by Stephen Cook published January 1985 in Information and control

An overview of computational complexity

Logical Foundations of Proof Complexity

scientific article (publication date: 2009)

On the minimum computation time of functions

scientific article published in 1969

Problems complete for deterministic logarithmic space

article by Stephen Cook & Pierre McKenzie published September 1987 in Journal of Algorithms

The complexity of theorem-proving procedures

The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy

Two Applications of Inductive Counting for Complementation Problems

scientific article (publication date: June 1989)

Paulina is supported by:

About Paulina

Help