{"title":"The effect of basis on size of Boolean expressions","authors":"V. Pratt","doi":"10.1109/SFCS.1975.29","DOIUrl":"https://doi.org/10.1109/SFCS.1975.29","url":null,"abstract":"To within a constant factor, only two complexity classes of complete binary bases exist. We show that they are separated by at most O(nlog310), or about O(n2.095), complementing a result of Khrapchenko that establishes an order n2 lower bound.","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115102940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Information theory and the complexity of switching networks","authors":"N. Pippenger","doi":"10.1109/SFCS.1975.18","DOIUrl":"https://doi.org/10.1109/SFCS.1975.18","url":null,"abstract":"such functions. The asymptotic behavior of these functions is summarized by the following formulae. These questions are answered by combinatorial arguments, but in each case the answer admits an informationtheoretic interpretation that renders it more memorable. This interpretation has only heuristic significance, however, and does not provide an alternate means of deriving our results. (see [5]) (see [1])","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115376077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the decision tree complexity of the shortest path problems","authors":"M. Fredman","doi":"10.1109/SFCS.1975.22","DOIUrl":"https://doi.org/10.1109/SFCS.1975.22","url":null,"abstract":"In this paper we present two new bounds on the decision tree complexity of the all-pairs shortest path problem, one for the worst case complexity and one for the average complexity. Let G be a graph on N vertices with N(N-I) directed edges joining each ordered pair of distinct vertices, and assume that each edge is assigned a nonnegative weight. Between any two vertices V.,V., i I j, there exists a directed path from v. to 1 .1 1 v. of minimum weighted length, the value of which we .1 denote by L... The computation of the N(N-I) values 1.1 L .. , 1 ~ i I j ~ N, is referred to as the all-pairs 1.1 shortest path problem. This problem and some variations of it have been investigated by a number of authors.","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124846093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluating relational expressions with dense and sparse arguments","authors":"T. G. Szymanski, J. Ullman","doi":"10.1137/0206009","DOIUrl":"https://doi.org/10.1137/0206009","url":null,"abstract":"We consider expressions whose arguments are relations and whose operators are chosen from among ∪, ο, *, and -1. We further assume that operands may be designated \"sparse\" or \"dense\", in a manner to be made formal subsequently. Our aim is to determine whether the evaluation of such an expression is (a) as hard as general transitive closure (b) as hard as transitive closure for sparse graphs. (c) as hard as connected components of an undirected graph.","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127812570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A note on tape bounds for sla language processing","authors":"J. Hartmanis, L. Berman","doi":"10.1109/SFCS.1975.2","DOIUrl":"https://doi.org/10.1109/SFCS.1975.2","url":null,"abstract":"In this note we show that the tape bounded complexity classes of languages over single letter alphabets are closed under complementation. We then use this result to show that there exists an infinite hierarchy of tape bounded complexity classes of sla languages between log n and log log n tape bounds. We also show that every infinite sla language recognizable on less than log n tape has infinitely many different regular subsets, and, therefore, the set of primes in unary notation, P, requires exactly log n tape for its recognition and every infinite subset of P requires at least log n tape.","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133807661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The exact time required to perform generalized addition","authors":"R. W. Floyd","doi":"10.1109/SFCS.1975.31","DOIUrl":"https://doi.org/10.1109/SFCS.1975.31","url":null,"abstract":"","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130785633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On time versus space and related problems","authors":"J. Hopcroft, W. Paul, L. Valiant","doi":"10.1109/SFCS.1975.23","DOIUrl":"https://doi.org/10.1109/SFCS.1975.23","url":null,"abstract":"The main result of this paper is to settle in the affirmative the fundamental question as to whether space is strictly more powerful than time as a resource for multi-tape Turing machines. As a consequence we establish the existence of a context-sensitive language requiring more than linear time for recognition on a multi-tape Turing machine. Let DTIME(t(n)) [NTIME(t(n))] be the class of sets accepted by deterministic [nondeterministic] multi-tape Turing machines of time complexity t(n). Let DSPACE(s(n)) [NSPACE(s(n))] be the class of sets accepted by deterministic [nondeterministic] multi-tape Turing machines of space complexi ty s (n) . We show","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126306503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the complexity of comparison problems using linear functions","authors":"A. Yao","doi":"10.1109/SFCS.1975.20","DOIUrl":"https://doi.org/10.1109/SFCS.1975.20","url":null,"abstract":"3. Summary of Results Ig 19 n-19 Ig(k/n) + 0(1) if k > n n/k + Ig 19 k + 0(1) if k < n We shall prove Theorems 1 and 2 in Sections 4 and 5. The proof of Theorem 3 is in the same vein and will not be given here.","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129103728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An optimal bound for two dimensional bin packing","authors":"D. Kleitman, M. Krieger","doi":"10.1109/SFCS.1975.6","DOIUrl":"https://doi.org/10.1109/SFCS.1975.6","url":null,"abstract":"Bin packing and dynamic allocation problems hold an important place both in theoretical computer science and in practical issues arising in computer applications and operations research. While major analytic advances have been made for the 1-dimension case, optimal results for 2-dimensional problems have been elusive. As a model for analysis of various multidimensional bin packing and cutting stock problems, we consider the following question. Let be an arbitrary finite family of squares of total area at most unity; what is the smallest rectangle into which any such family can be packed without overlap? We answer this with the following optimal result: 1) any unit family can be packed into a rectangle with sides 2/√3 and √2; 2) any other rectangle with this packing property has larger area. The proof of this is rather lengthy and technical. We therefore restrict this presentation to a general discussion of the methods used and an outline of the major cases together with some specific examples.","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"2004 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114086887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The effect of the field of constants on the number of multiplications","authors":"S. Winograd","doi":"10.1109/SFCS.1975.30","DOIUrl":"https://doi.org/10.1109/SFCS.1975.30","url":null,"abstract":"","PeriodicalId":322795,"journal":{"name":"16th Annual Symposium on Foundations of Computer Science (sfcs 1975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1975-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129301289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}