Thumbnail
Access Restriction
Subscribed

Author Allender, Eric W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1989
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Much complexity-theoretic work on parallelism has focused on the class NC, which is defined in terms of logspace-uniform circuits. Yet P-uniform circuit complexity is in some ways a more natural setting for studying feasible parallelism. In this paper, P-uniform NC (PUNC) is characterized in terms of space-bounded AuxPDAs and alternating Turing Machines with bounded access to the input. The notions of general-purpose and special-purpose computation are considered, and a general-purpose parallel computer for PUNC is presented. It is also shown that NC = PUNC if all tally languages in P are in NC; this implies that the NC = PUNC question and the NC = P question are both instances of the $ASPACE(\textit{S}(\textit{n}))$ = $ASPACE,TIME(\textit{S}(\textit{n}),$ $\textit{S}(\textit{n})\textit{o}(1))$ question. As a corollary, it follows that NC = PUNC implies PSPACE = $DTIME(2\textit{no}(1)).$
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1989-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 36
Issue Number 4
Page Count 17
Starting Page 912
Ending Page 928


Open content in new tab

   Open content in new tab
Source: ACM Digital Library