## 22nd Annual Symposium on Foundations of Computer Science: October 28-30, 1981, Nashville, Tennessee |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Wednesday October 281981 | 1 |

An Approach to VLSI Upper Bounds Preliminary Version | 13 |

Optimizing Synchronous Systems | 23 |

Copyright | |

29 other sections not shown

### Common terms and phrases

algebra algorithm automata binary binary tree Boolean census circuit complexity component Computer Science conjunct conjunct-pair consider constant construction contains Corollary corresponding database defined definition degree deleted denote deterministic dynamic logic edges elements equation equivalent example exists expanding graphs expected number faulty processors Figure finite automaton formula function given grammar graph G Hence implies induction input integer irreducible polynomial labelled language least Lemma length linear logic lower bound mapping matrix mesh node nondeterministic nondeterministic finite automata NP-complete operations oracle machine output parallel path pebbling planar graph polynomial problem Proc prove PSPACE query random recursive regular expressions result root satisfies search number self-organizing heuristic sequence serializability simulation space stage step string structure subset Suppose systolic Theorem Theory tion transaction tree Turing machines upper bound variables vertex VLSI worktape