<--- Back to Details
First PageDocument Content
P-complete / NC / Algorithm / Computational complexity theory / NP / Stephen Cook / Reduction / Parallel computing / Complexity / Theoretical computer science / Complexity classes / Applied mathematics
Date: 2008-08-20 14:40:21
P-complete
NC
Algorithm
Computational complexity theory
NP
Stephen Cook
Reduction
Parallel computing
Complexity
Theoretical computer science
Complexity classes
Applied mathematics

Limits to Parallel Computation

Add to Reading List

Source URL: www.cs.armstrong.edu

Download Document from Source Website

File Size: 1,15 MB

Share Document on Facebook

Similar Documents

Sorting algorithms / Order theory / Mathematics / Computing / Bucket sort / Radix sort / Merge sort / Partition / Merge algorithm / Sorting

Millisort: An Experiment in Granular Computing Seo Jin Park with Yilong Li, Collin Lee and John Ousterhout Massively Parallel Granular Computing

DocID: 1xUyt - View Document

Computing / Computer architecture / Concurrency control / Computer engineering / Memory barrier / Linearizability / Memory model / Thread / Parallel computing / Fetch-and-add / Lock / Instruction set architecture

arXiv:1803.04432v1 [cs.DC] 12 MarMemory Models for C/C++ Programmers Manuel P¨oter Jesper Larsson Tr¨aff Research Group Parallel Computing

DocID: 1xTxL - View Document

FEIIC International Journal of Engineering and Technology, Vol. 13, No.2, 2016, ppSURVEY ANALYSIS ON THE EMBEDDED TCPP CURRICULUM IN PARALLEL AND DISTRIBUTED COMPUTING COURSE

DocID: 1vq34 - View Document

Parallel Computing with IPython: an application to air pollution modeling

DocID: 1vlLp - View Document

Multi-EM Multi-Method Inversion to Determine the Electrical Conductivity Distribution of the Subsurface Using Parallel Computing Architectures Multi-EM

DocID: 1uVPD - View Document