发布求助
文献互助 智能选刊 最新文献

Proceedings of the tenth annual ACM symposium on Theory of computing最新文献

筛选
英文 中文
Algorithms for edge coloring bipartite graphs 边着色二部图的算法
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804346
H. Gabow, O. Kariv
{"title":"Algorithms for edge coloring bipartite graphs","authors":"H. Gabow, O. Kariv","doi":"10.1145/800133.804346","DOIUrl":"https://doi.org/10.1145/800133.804346","url":null,"abstract":"A minimum edge coloring of a bipartite graph is a partition of the edges into &Dgr; matchings, where &Dgr; is the maximum degree in the graph. Coloring algorithms are presented that use time O(min(¦E¦ &Dgr; log n, ¦E¦ @@@@n log n, n2log &Dgr;)) and space O(n&Dgr;). This compares favorably to the previous O(¦E¦ [equation] log &Dgr;) time bound. The coloring algorithms also find maximum matchings on regular (or semi-regular) bipartite graphs. The time bounds compare favorably to the O(¦E¦ @@@@n) matching algorithm, expect when [equation] ≤ &Dgr; ≤ @@@@n log n.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123102445","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}
引用次数: 29
Combinatorial optimization with rational objective functions 具有有理目标函数的组合优化
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804326
N. Megiddo
{"title":"Combinatorial optimization with rational objective functions","authors":"N. Megiddo","doi":"10.1145/800133.804326","DOIUrl":"https://doi.org/10.1145/800133.804326","url":null,"abstract":"Let A be the problem of minimizing c1x1+...+cnxn subject to certain constraints on x=(x1,...,xn), and let B be the problem of minimizing (a0+a1x1+...+anxn)/(b0+b1x1+...+bnxn) subject to the same constraints, assuming the denominator is always positive. It is shown that if A is solvable within O[p(n)] comparisons and O[q(n)] additions, then B is solvable in time O[p(n)(q(n)+p(n))]. This applies to most of the “network” algorithms. Consequently, minimum ratio cycles, minimum ratio spanning trees, minimum ratio (simple) paths, maximum ratio weighted matchings, etc., can be computed within polynomial-time in the number of variables. This improves a result of E. L. Lawler, namely, that a minimum ratio cycle can be computed within a time bound which is polynomial in the number of bits required to specify an instance of the problem. A recent result on minimum ratio spanning trees by R. Chandrasekaran is also improved by the general arguments presented in this paper. Algorithms of time-complexity O(¦E¦ • ¦V¦2•log¦V¦) for a minimum ratio cycle and O(¦E¦ • log2¦V¦ • log log ¦V¦) for a minimum ratio spanning tree are developed.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115547691","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}
引用次数: 509
On the completeness of a generalized matching problem 一类广义匹配问题的完备性
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804353
D. Kirkpatrick, P. Hell
{"title":"On the completeness of a generalized matching problem","authors":"D. Kirkpatrick, P. Hell","doi":"10.1145/800133.804353","DOIUrl":"https://doi.org/10.1145/800133.804353","url":null,"abstract":"A perfect matching in a graph H may be viewed as a collection of subgraphs of H, each of which is isomorphic to K2, whose vertex sets partition the vertex set of H. This is naturally generalized by replacing K2 by an arbitrary graph G. We show that if G contains a component with at least three vertices then this generalized matching problem is NP-complete. These generalized matchings have numerous applications including the minimization of second-order conflicts in examination scheduling.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131550925","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}
引用次数: 164
On the parallel evaluation of multivariate polynomials 多元多项式的并行求值
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804347
L. Hyafil
{"title":"On the parallel evaluation of multivariate polynomials","authors":"L. Hyafil","doi":"10.1145/800133.804347","DOIUrl":"https://doi.org/10.1145/800133.804347","url":null,"abstract":"We prove that any multivariate polynomial P of degree d that can be computed with C(P) multiplications-divisions can be computed in O(log d.log C(P)) parallel steps and O(log d) parallel multiplicative steps.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113979099","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}
引用次数: 65
Relativized questions involving probabilistic algorithms 涉及概率算法的相对问题
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804363
C. Rackoff
{"title":"Relativized questions involving probabilistic algorithms","authors":"C. Rackoff","doi":"10.1145/800133.804363","DOIUrl":"https://doi.org/10.1145/800133.804363","url":null,"abstract":"Let R @@@@ NP be the collection of languages L such that for some polynomial time computable predicate P(x,y) and constant k, L = {x|@@@@y, |y|=|x|k,P(x,y)} = {x|@@@@ at least 2|x|k−1 values of y, |y|=|x|k,P(x,y)}. Let U @@@@ NP be the collection of languages L such that for some polynomial time computable predicate P(x,y) and constant k, L = {x|@@@@y,|y|=|x|k,P(x,y)}= {x|@@@@ unique y, |y|=|x|k,p(x,y)}. Let RA,UA, PA,NPA,CO-NPA be the relativization of these classes with respect to an oracle A as in [ 5 ]. Then for some oracle E (NPE @@@@ CO-NPE) = UE = RE = PE @@@@ NPE while for some other oracle D CO-NPD = NPD = UD = RD @@@@ PD.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114539818","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}
引用次数: 6
Exact and approximate membership testers 精确和近似成员测试器
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804332
L. Carter, R. W. Floyd, John Gill, G. Markowsky, M. Wegman
{"title":"Exact and approximate membership testers","authors":"L. Carter, R. W. Floyd, John Gill, G. Markowsky, M. Wegman","doi":"10.1145/800133.804332","DOIUrl":"https://doi.org/10.1145/800133.804332","url":null,"abstract":"In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an exact membership tester is a procedure that for each element s in U determines if s is in V. An approximate membership tester is allowed to make mistakes: we require that the membership tester correctly accepts every element of V, but we allow it to also accept a small fraction of the elements of U - V.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124033367","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}
引用次数: 130
Node-and edge-deletion NP-complete problems 节点和边删除np完全问题
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804355
M. Yannakakis
{"title":"Node-and edge-deletion NP-complete problems","authors":"M. Yannakakis","doi":"10.1145/800133.804355","DOIUrl":"https://doi.org/10.1145/800133.804355","url":null,"abstract":"If &pgr; is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property &pgr;. In this paper we show that if &pgr; belongs to a rather broad class of properties (the class of properties that are hereditary on induced subgraphs) then the node-deletion problem is NP-complete, and the same is true for several restrictions of it. For the same class of properties, requiring the remaining graph to be connected does not change the NP-complete status of the problem; moreover for a certain subclass, finding any \"reasonable\" approximation is also NP-complete. Edge-deletion problems seem to be less amenable to such generalizations. We show however that for several common properties (e.g. planar, outer-planar, line-graph, transitive digraph) the edge-deletion problem is NP-complete.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126297989","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}
引用次数: 487
An NP-complete number-theoretic problem 一个np完全数论问题
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804349
E. Gurari, O. Ibarra
{"title":"An NP-complete number-theoretic problem","authors":"E. Gurari, O. Ibarra","doi":"10.1145/800133.804349","DOIUrl":"https://doi.org/10.1145/800133.804349","url":null,"abstract":"Systems of nonlinear equations of the form D: Ay = σ.(x), where A is an m×n matrix of rational constants and y = (Y1,...,yn), σ(x) = (σ1(x),..., σm (x)) are column vectors are considered. Each σi(x) is of the form ri(x) or @@@@ri(x)@@@@, where ri(x) is a rational function of x with rational coefficients. It is shown that the problem of determining for a given system D whether there exists a nonnegative integral solution (y1,...,yn,X) satisfying D is decidable. In fact, the problem is NP-complete when restricted to systems D in which the maximum degree of the polynomials defining the σi(x)'s is bounded by some fixed polynomial in the length of the representation of D. Some recent results connecting Diophantine equations and counter machines are briefly mentioned.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557072","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}
引用次数: 5
On the nlog n isomorphism technique (A Preliminary Report) 论nlogn同构技术(初报)
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804331
G. Miller
{"title":"On the nlog n isomorphism technique (A Preliminary Report)","authors":"G. Miller","doi":"10.1145/800133.804331","DOIUrl":"https://doi.org/10.1145/800133.804331","url":null,"abstract":"Tarjan has given an algorithm for deciding isomorphism of two groups of order n (given as multiplication tables) which runs in O(n(log2n+O(1)) steps where n is the order of the groups. Tarjan uses the fact that a group of n is generated by log n elements. In this paper, we show that Tarjan's technique generalizes to isomorphism of quasigroups, latin squares, Steiner systems, and many graphs generated from these combinatorial objects.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124685703","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}
引用次数: 96
Operational and semantic equivalence between recursive programs. 递归程序之间的操作和语义等价。
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804334
J. Raoult, J. Vuillemin
{"title":"Operational and semantic equivalence between recursive programs.","authors":"J. Raoult, J. Vuillemin","doi":"10.1145/800133.804334","DOIUrl":"https://doi.org/10.1145/800133.804334","url":null,"abstract":"In this paper, we show that two widely different notions of program equivalence coincide for the language of recursive definitions with simplification rules. The first one is the now classical equivalence for fixed-point semantics. The other one is purely operational in nature and is much closer to a programmer's intuition of program equivalence.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121353790","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}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信