IEEE CATALOG NO. 75 CH 1003-3C
Copies available frorTl: lEE E Computer Society 5855 Naples Plaza, Suite 301 Long Beach, California 90803 lEE E, Order Department 345 East 47th Street New York, New York 10017
Copyright 1975 by The Insti tute of EIectricaI and Electrof1ics Engl IH-;ers, I r 1C. 16th Annual Symposium on Foundations of Computer Science (Formerly called the Annual Symposium on S'witching and Automata Theory)
sponsored by IEEE Conlputer Society Technical COllllllittl'l' on f'v1athelllatical Foundations of COlllputing in co()peration with thl' ACM Special Interest Group for Autolllata and COlllputability Theory and the DepartInent of Electrical Engineering and Conlputer Sciences, The University of California, Berkeley
~. {\ - •. 1- . __ 1'"} 1 Cl{)'"7C A. _ . _. ._ Ieee Computer :::ioclety ~ "-.)LllJl'L·1 1 ,1-1 ,', 17/ ,I <.~ Institute ot clectrlCJI Jncl electronics engineers y®
Additional copies available from:
I EEE Computer Society IEEE 5855 Naples Plaza 445 Hoes Lane Long Beach, CA 90803 Piscataway, NJ 08854
IEEE 75 CH 1003-3C
Copyright ©1975 by the Institute of Electrical and Electronics Engineers, Inc. 1975 SIXTEENTH ANNUAL SYMPOSIUM ON
FOUNDATIONS OF COMPUTER SCIENCE
OCTOBER 13-15, 1975
TABLE OF CONTENTS Monday, October 13
Session I: Ian Munro, Chairman
The Effect of the Field of Constants on the Number of Multiplications by Shmuel Winograd . 1
The Exact Time Required to Perform Generalized Addition by Robert W. Floyd . 3
Polynomials with 0-1 Coefficients that are Hard to Evaluate by Richard J. Lipton . 6
Fast Parallel Matrix Inversion Algorithms by L. Csanky . 11
Parallel Computations in Graph Theory by Eshrat Arjomandi and D. G. Corneil 13
Synchronization and Computing Capabilities of Linear Asynchronous Structures by R. J. Lipton, R. E. Miller and L. Snyder...... 19
Session II: Robert L. Constable, Chairman
Flow of Control in the Proof Theory of Structured Programming by J. W. de Bakker 29
Bases for Chain-Complete Posets by George Markowsky and Barry K. Rosen...... 34
Correct Computation Rules for Recursive Languages by Peter J. Downey and Ravi Sethi 48
On Time Versus Space and Related Problems by John Hopcroft, Wolfgang Paul and Leslie Valiant 57
A Note on Tape Bounds for sla Language Processing by J. Hartmanis and L. Berman 65
(iv) Tuesday, October 14
Session III: Patrick C. Fischer, Chairman
Minimean Optimality in Sorting Algorithms by Ira Pohl 71
Preserving Order in a Forest in Less Than Logarithmic Time by P. van Emde Boas 75
On the Complexity of Comparison Problems Using Linear Functions by Andew Chi-Chih Yao 85
Evaluating Relational Expressions with Dense and Sparse Arguments by T. G. Szymanski and J. D. Ullman 90
On the Decision Tree Complexity of the Shortest Path Problems by Michael L. Fredman 98 2 5 An 0(n . ) Algorithm for Maximum Matching in General Graphs by S. Even and O. Kariv ~ ...... 100
Session IV: Sheldon B. Akers, Chairman
Information Theory and the Complexity of Switching Networks by Nicholas Pippenger 113
The Effect of Basis on Size of Boolean Expressions by V. R. Pratt 119
Economy of Description by Parsers, DPDA's, and PDA's by Matthew M.Geller, Harry B. Hunt III, Thomas G. Szymanski and Jeffrey D. Ullman .. 122
An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata by C. Beeri 128
A Grammatical Characterization of Exponential-Time Languages by William C. Rounds 135
Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages by H. B. Hunt III and J. L. Rangel 144
Wednesday, October 15
Session V: Alfred V. Aho, Chairman
Closest-Point Problems by Michael Ian Shamos and Dan Hoey 151
An Optimal Bound for Two Dimensional Bin Packing by Daniel J. Kleitman and Michael M. Krieger...... 163 Computational Complexity of Decision Procedures for Polynomials by Leonard Adleman and Kenneth Manders 169
An Application of Graph Coloring to Printed Circuit Testing by M. R. Garey, D. S. Johnson and H. C. So 178
On the Complexity of Timetable and Multi-Commodity Flow Problems by S. Even, A. Itai and A. Shamir . 184 (v)