Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Parallel Algorithm
Related Publications
(30)
The Parallel Evaluation of General Arithmetic Expressions
On the Tape Complexity of Deterministic ContextFree Languages
Complexity and Structure in Formal Language Theory
Provably efficient scheduling for languages with finegrained parallelism
On the Hardness of Graph Isomorphism
Subscribe
Academic
Publications
A Taxonomy of Problems with Fast Parallel Algorithms
A Taxonomy of Problems with Fast Parallel Algorithms,10.1016/S00199958(85)800413,Information and Computation/information and Control,Stephen A. Cook
Edit
A Taxonomy of Problems with Fast Parallel Algorithms
(
Citations: 348
)
BibTex

RIS

RefWorks
Download
Stephen A. Cook
Journal:
Information and Computation/information and Control  IANDC
, vol. 64, no. 13, pp. 221, 1985
DOI:
10.1016/S00199958(85)800413
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.informatik.unitrier.de
)
(
linkinghub.elsevier.com
)
Citation Context
(136)
...(This should not be confused with the notation from Cook’s survey [
8
], which considers NC1reductions.) ⊕L is appropriately closed, and...
...These functions include many standard problems of linear algebra over the rings Z and Zk ([7], [
8
], [6], [5]), as discussed in Section 6...
...There are a number of algebraic problems which [
8
], [7], [6], and [5] prove are NC1...
Lila A. Fontes
.
Formal Theories for Logspace Counting
...We should clarify that our definition of DET here differs from that in [
Coo85
], where DET is defined to be NC 1 (det), the closure of {det} under the more general NC 1 reductions...
Stephen Cook
,
et al.
Formal Theories for Linear Algebra
...Cook’s conjecture [
16
] that “a problem in NL which is probably not complete is the knapsack problem with unary weights,” a line of research began to capture its complexity with specialized complexity classes lying between L and NL [27], [15], [31], see also [34]...
Michael Elberfeld
,
et al.
Logspace Versions of the Theorems of Bodlaender and Courcelle
...The new parallel complexity class N C had been described by Stephen Cook (see [
7
]) and exact linear algebra problems were shown within it [5], in fact within uniform logsquared circuit depth...
Erich L. Kaltofen
.
Fifteen years after DSC and WLSS2 what parallel computations I do toda...
...With respect to lower bounds, GI is known to be hard for DET [26], where DET is the class of problems that are NC 1 reducible to the determinant defined by Cook [
6
]...
Thomas Thierauf
,
et al.
The Isomorphism Problem for Planar 3Connected Graphs Is in Unambiguous...
Sort by:
Citations
(348)
Formal Theories for Logspace Counting
(
Citations: 2
)
Lila A. Fontes
Journal:
Computing Research Repository  CORR
, vol. abs/1001.1, 2010
Formal Theories for Linear Algebra
(
Citations: 2
)
Stephen Cook
,
Lila Fontes
Conference:
Computer Science Logic  CSL
, pp. 245259, 2010
Logspace Versions of the Theorems of Bodlaender and Courcelle
(
Citations: 2
)
Michael Elberfeld
,
Andreas Jakoby
,
Till Tantau
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 143152, 2010
Amplifying lower bounds by means of selfreducibility
Eric Allender
,
Michal Koucký
Journal:
Journal of The ACM  JACM
, vol. 57, no. 3, pp. 136, 2010
Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010
Erich L. Kaltofen
Conference:
Computer Algebra and Parallelism
, pp. 1017, 2010