New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

Previous theoretical work in computational complexity has suggested that any problem which is log-space complete for P is not likely in NC, and thus not parallelizable. In practice, this is not the case. To resolve this paradox, we introduce new complexity classes PC and PC* that capture the practic...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. C-35; no. 5; pp. 403 - 418
Main Authors:	Vitter, Simons
Format:	Journal Article
Language:	English
Published:	IEEE 01.05.1986
Subjects:	Circuit value completeness computational complexity Computational modeling depth-first search fifth generation Integrated circuit modeling Mathematical models Memory management Parallel algorithms path system Phase change random access memory Polynomials PRAM RAM random access Search problems SIMO unification union-find WRAM Writing
ISSN:	0018-9340, 1557-9956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!