## 16th Annual Symposium on Foundations of Computer Science, October 13-15, 1975 |

### What people are saying - Write a review

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

### 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(N log algorithm arbitrary arguments assign assume asynchronous augmenting path Automata binary cfl's chain-complete poset comparisons complexity Computer Science configuration consider construction contains Corollary correct corresponding D-computation defined definition delete denote dense graphs deterministic DPDA Dyck language element equivalence evaluation example exists expression finite follows free edge function given grammar graph graph coloring Hence implies induction infinite input integers leaf Lemma length linear log log lower bound minimum minimum spanning tree node nondeterministic NP-complete obtain operations pair parsers pebbles planar graph points polygons polynomial poset priority queue problem procedure processors Proof prove pushdown recursive relation replacement result satisfies segment sequence simulation sla languages stage string structure subset subtree supremum symbol Theorem Theory tion track transformational grammar tree Turing machine undirected graph upper bound variables vertex vertices Voronoi diagram Voronoi polygons