Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, Washington, D.C., April 30-May 2, 1984, Volume 16 |
Contents
Monday April 30 1984 | 1 |
Deciding Branching Time Logic | 14 |
Modelling Fair Processes | 25 |
Copyright | |
34 other sections not shown
Other editions - View all
Common terms and phrases
ACM copyright notice algebraic algorithm assume automaton binary binary tree bits block Cartesian tree circuit column complexity Computer Science consider construct contains convex corresponding data structure defined denote deterministic edge elements ellipsoid equation expected number exponential factor finite formula function graph Hence induction infinite input integer intersection irreducible polynomials label Lemma length linear logic lower bound matrix matroid maximal independent set minimal minimum spanning tree node O(log obtained optimal orthant packing pair parallel parallel computation partition planar graph points polynomial probabilistic probability problem Proc procedure processors proof properties protocol prove random recursive requires result rithm routing S-expressions satisfy segment sequence solution solved sorting space spanning tree step subset synchronous temporal logic Theorem tion total number tree automaton update upper bound variables vector vertex vertices VLSI