# Characterizations of PUNC and precomputation

## 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 AuxPDA's and alternating Turing Machines with bounded access to the input. We also present a general-purpose parallel computer for PUNC; this characterization leads to an easy proof that NC = PUNC iff all tally languages in P are in NC. The characterizations of PUNC lead to natural methods for modelling precomputation. We show that for many classes of interest, there is a single “universal” table which can be used in place of any table of similar size and complexity, while for certain other classes, no such “universal” table exists.

## Keywords

Turing Machine Circuit Complexity Mathematical System Theory Input Head Precomputed Table## Preview

Unable to display preview. Download preview PDF.

## References

- [Ad-78]L. Adleman,
*Two theorems on random polynomial time*, Proc. 19th IEEE Symposium on Foundations of Computer Science, pp. 307–311.Google Scholar - [Al-85]E. W. Allender,
*Invertible functions*, Doctoral Dissertation, Georgia Institute of Technology.Google Scholar - [Al-86]E. W. Allender,
*The complexity of sparse sets in P*, Paper presented at the Structure in Complexity Theory Conference, Berkeley, to appear in Lecture Notes in Computer Science.Google Scholar - [BDG-85]J. L. Balcazar, J. Diaz, J. Gabarro,
*On some “non-uniform” complexity measures*, 5th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 199, pp. 18–27.Google Scholar - [BCH-84]P. W. Beame, S. A. Cook, and H. J. Hoover,
*Log depth circuits for division and related problems*, Proc. 25th IEEE Symposium on Foundations of Computer Science, pp. 1–11.Google Scholar - [Bo-74]R. V. Book,
*Tally languages and complexity classes*, Information and Control 26, 186–193.Google Scholar - [Br-77a]F.-J. Brandenburg,
*On one-way auxiliary pushdown automata*, Proc. 3rd GI Conference, Lecture Notes in Computer Science 48, pp. 133–144.Google Scholar - [Br-77b]F.-J. Brandenburg,
*The contextsensitivity of contextsensitive grammars and languages*, Proc. 4th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 52, pp. 272–281.Google Scholar - [CSV-84]A. K. Chandra, L. J. Stockmeyer, U. Vishkin,
*Constant depth reducibility*, SIAM J. Comput. 13, 423–439.Google Scholar - [Ch-77]M. P. Chytil,
*Comparison of the active visiting and the crossing complexities*, Proc. 6th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 53, pp. 272–281.Google Scholar - [Co-81]S. A. Cook,
*Towards a complexity theory of synchronous parallel computation*, L'Enseignement Mathematique 27, 99–124.Google Scholar - [Co-83]S. A. Cook,
*The classification of problems which have fast parallel algorithms*. Proc. 4th International Conference on Foundations of Computation Theory, Lecture Notes in Computer Science 158, pp. 78–93.Google Scholar - [DC-80]P. W. Dymond and S. A. Cook,
*Hardware complexity and parallel computation*, Proc. 20th IEEE Symposium on Foundations of Computer Science, pp. 360–372.Google Scholar - [vzG-84]J. von zur Gathen,
*Parallel powering*, Proc. 25th Annual ACM Symposium on Theory of Computing, pp. 31–36.Google Scholar - [Ga-77]Z. Galil,
*Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages*, Mathematical Systems Theory 10, 211–228.Google Scholar - [GP-83]Z. Galil and W. Paul,
*An efficient general-purpose parallel computer*, J. ACM 30, 360–387.Google Scholar - [GS-85]A. V. Goldberg and M. Sipser,
*Compression and ranking*, Proc. 17th Annual ACM Symposium on Theory of Computing, pp. 440–448.Google Scholar - [Go-82]L. M. Goldschlager,
*A universal interconnection pattern for parallel computers*, J. ACM 29, 1073–1086.Google Scholar - [Ha-83]J. Hartmanis,
*Generalized Kolmogorov complexity and the structure of feasible computations*, Proc. 24th IEEE Symposium on Foundations of Computer Science, pp. 439–445.Google Scholar - [HY-84]J. Hartmanis and Y. Yesha,
*Computation times of NP sets of different densities*, Theoretical Computer Science 34, 17–32.Google Scholar - [Hu-85]D. T. Huynh,
*Non-uniform complexity and the randomness of certain complete languages*, Technical Report TR 85–34, Computer Science Department, Iowa State University.Google Scholar - [Jo-75]N. D. Jones,
*Space-bounded reducibility among combinatorial problems*, J. Computer and System Sciences 11, 68–85.Google Scholar - [KL-82]R. M. Karp and R. J. Lipton,
*Turing machines that take advice*, L'Enseignement Mathematique 28, 191–209.Google Scholar - [Ki-81a]K. N. King,
*Measures of parallelism in alternating computation trees*, Proc. 13th Annual ACM Symposium on Theory of Computing, pp. 189–201.Google Scholar - [Ko-83]K.-I. Ko,
*On the definition of some complexity classes of real numbers*, Mathematical Systems Theory 16, 95–109.Google Scholar - [Ko-84]K.-I. Ko,
*A definition of infinite pseudorandom sequences*, manuscript, University of Houston.Google Scholar - [Pi-81]N. Pippenger,
*Pebbling with an auxiliary pushdown*, J. Computer and System Sciences 23, 151–165.Google Scholar - [Ra-85]C. Rackoff, personal communication.Google Scholar
- [Ru-81]W. L. Ruzzo,
*On uniform circuit complexity*, J. Computer and System Sciences 21, 365–383.Google Scholar - [Ru-85]W. L. Ruzzo, personal communication.Google Scholar
- [St-74]L. J. Stockmeyer,
*The complexity of decision problems in automata theory and logic*, Doctoral Dissertation, M.I.T.Google Scholar - [Su-83]I. H. Sudborough,
*Bandwidth constraints on problems complete for polynomial time*, Theoretical Computer Science 26, 25–52.Google Scholar - [Vi-83]U. Vishkin,
*Synchronous parallel computation — a survey*, preprint, Courant Institute, New York University.Google Scholar - [Vi-84]U. Vishkin,
*A parallel-design distributed-implementation (PDDI*general-purpose computer), Theoretical Computer Science 32, 157–172.Google Scholar - [We-79]G. Wechsung,
*The oscillation complexity and a hierarchy of context-free languages*, Proc. 2nd Proc. 2nd International Conference on Fundementals of Computation Theory, Akademie-Verlag, Berlin, GDR, pp. 508–515.Google Scholar - [We-80]G. Wechsung,
*A note on the return complexity*, Elektronische Informationsverarbeitung und Kybernetik 16, 139–146.Google Scholar - [WB-79]G. Wechsung and A. Brandstadt,
*A relation between space, return and dual return complexities*, Theoretical Computer Science 9, 127–140.Google Scholar