An observation on time-storage trade off
Reads0
Chats0
TLDR
There are two main results proved here that state that a certain set SP of strings (those coding ''solvable path systems'') has tape complexity (log n)^2 iff every set in (i.e., of deterministic polynomial time complexity) has Tape complexity ( log n,^2).About:
This article is published in Journal of Computer and System Sciences.The article was published on 1974-12-01 and is currently open access. It has received 194 citations till now.read more
Citations
More filters
Book ChapterDOI
Parallel algorithms for shared-memory machines
TL;DR: In this paper, the authors discuss parallel algorithms for shared-memory machines and discuss the theoretical foundations of parallel algorithms and parallel architectures, and present a theoretical analysis of the appropriate logical organization of a massively parallel computer.
Book ChapterDOI
A catalog of complexity classes
TL;DR: This chapter discusses the concepts needed for defining the complexity classes, a set of problems of related resource-based complexity that can be solved by an abstract machine M using O(f(n) of resource R, where n is the size of the input.
Book
Limits to Parallel Computation: P-Completeness Theory
TL;DR: In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.
Journal ArticleDOI
Depth-first search is inherently sequential
TL;DR: It is shown that this problem, for undirected and directed graphs, is complete in deterministic polynomial time with respect to deterministic log-space reductions.
Book
Introduction to the theory of complexity
TL;DR: 1. Mathematical Preliminaries, Elements of Computability Theory, and Space-Complexity Classes: Algorithms and Complexity Classes.
References
More filters
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Book
Formal Languages and Their Relation to Automata
TL;DR: The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.
Journal ArticleDOI
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
TL;DR: A class of machines called auxiliary pushdown machines is introduced, characterized in terms of time-bounded Turing machines, and corollaries are derived which answer some open questions in the field.
Proceedings ArticleDOI
Memory bounds for recognition of context-free and context-sensitive languages
TL;DR: The computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines is investigated and a "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy.
Comparative schematology
Mike Paterson,Carl Hewitt +1 more
TL;DR: The notion of universal programming languages was introduced in this article, where it was shown that a simple language with some basic arithmetic can express programs for any partial recursive function and that such an encoding is usually quite unnatural and impossibly inefficient.