22nd Annual Symposium on Foundations of Computer Science: October 28-30, 1981, [Nashville, Tennessee : Papers] |
Contents
Wednesday October 28 1981 | 1 |
An Approach to VLSI Upper Bounds Preliminary Version | 13 |
Optimizing Synchronous Systems | 23 |
Copyright | |
29 other sections not shown
Common terms and phrases
algorithm automata binary binary tree Boolean census circuit complexity component Computer Science conjunct conjunct-pair consider construction contains Corollary corresponding database defined definition degree deleted denote deterministic DTIME dynamic logic edges element equation equivalent example exists expanding graphs faulty processors Figure formula function grammar graph G Hence IEEE IIMs induction input integer labelled language least Lemma length linear logic lower bound M₁ node nondeterministic nondeterministic finite automata NP-complete NTIME O(log oracle machine output parallel path pebbling planar graph polynomial problem Proc Proof prove PSPACE query random recursive regular expressions result root satisfies SDPDL 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