A parallel-design distributed-implementation (PDDI) general-purpose computer
Theoretical Computer Science
A taxonomy of problems with fast parallel algorithms
Information and Control
Characterizations of PUNC and precomputation
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
The complexity of sparse sets in P
Proc. of the conference on Structure in complexity theory
Log depth circuits for division and related problems
SIAM Journal on Computing
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Some observations concerning alternating Turing machines using small space
Information Processing Letters
Isomorphisms and 1-L reductions
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
SIAM Journal on Computing
Complexity theory of parallel time and hardware
Information and Computation
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Alternating Multihead Finite Automata (Extended Abstract)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On one-way auxiliary pushdown automata
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
The Contextsensitivity Bounds of Contextsensitive Grammars and Languages
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Measures of parallelism in alternating computation trees (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Simultaneous resource bounds and parallel computation
Simultaneous resource bounds and parallel computation
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Reducing the complexity of reductions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Uniform Circuits, & Boolean Proof Nets
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Non-deterministic Boolean proof nets
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Tradeoff lower lounds for stack machines
Computational Complexity
| Hi-index | 0.00 |
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(S(n)) = ASPACE,TIME(S(n), S(n)o(1)) question. As a corollary, it follows that NC = PUNC implies PSPACE = DTIME(2no(1)).