16th Annual Symposium on Foundations of Computer Science, October 13-15, 1975 |
Contents
Polynomials with 01 Coefficients that are Hard to Evaluate | 6 |
Parallel Computations in Graph Theory | 13 |
Synchronization and Computing Capabilities of Linear Asynchronous Structures | 19 |
Copyright | |
4 other sections not shown
Common terms and phrases
0-computation algorithm arbitrary arguments assign assume asynchronous augmenting path Automata binary cfl's chain-complete poset comparisons complexity Computer Science configuration construction contains Corollary corresponding defined definition delete denote dense graphs deterministic DPDA Dyck language element equivalence evaluation exists expression finite follows free edge function given grammar graph graph coloring implies induction infinite input integers L₁ leaf Lemma length linear log log lower bound MATE minimum minimum spanning tree node nondeterministic NP-complete O(N log operations pair parsers pebbles points polygons polynomial poset priority queue problem procedure processors Proof prove pushdown recursive relation result satisfies segment sequence simulation sla languages stage string structure subset subtree supremum symbol tape Theorem Theory tion track transformational grammar tree Turing machine undirected graph upper bound variables vertex vertices Voronoi diagram Voronoi polygons