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

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

筛选
英文 中文
The complexity of perfect zero-knowledge 完美零知识的复杂性
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28418
L. Fortnow
{"title":"The complexity of perfect zero-knowledge","authors":"L. Fortnow","doi":"10.1145/28395.28418","DOIUrl":"https://doi.org/10.1145/28395.28418","url":null,"abstract":"A Perfect Zero-Knowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses. This paper demonstrates that knowledge complexity can be used to show that a language is easy to prove.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133032054","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}
引用次数: 247
Optimal bounds for decision problems on the CRCW PRAM CRCW PRAM上决策问题的最优界
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28405
P. Beame, J. Håstad
{"title":"Optimal bounds for decision problems on the CRCW PRAM","authors":"P. Beame, J. Håstad","doi":"10.1145/28395.28405","DOIUrl":"https://doi.org/10.1145/28395.28405","url":null,"abstract":"We prove optimal &OHgr;(log n/log log n) lower bounds on the time for CRCW PRAM's with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems. We also exhibit a strict time hierarchy of explicit Boolean functions of n bits on such machines which holds up to &Ogr;(log n/log log n) time. Furthermore, we show that almost all Boolean functions of n bits require log n - log log n + &OHgr;(1) time when the number of processors is at most polynomial in n. Our bounds do not place restrictions on the uniformity of the algorithms nor on the instruction sets of the machines.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133599789","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}
引用次数: 178
Solving minimum-cost flow problems by successive approximation 用逐次逼近法求解最小成本流问题
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28397
A. Goldberg, R. Tarjan
{"title":"Solving minimum-cost flow problems by successive approximation","authors":"A. Goldberg, R. Tarjan","doi":"10.1145/28395.28397","DOIUrl":"https://doi.org/10.1145/28395.28397","url":null,"abstract":"We introduce a framework for solving minimum-cost flow problems. Our approach measures the quality of a solution by the amount that the complementary slackness conditions are violated. We show how to extend techniques developed for the maximum flow problem to improve the quality of a solution. This framework allows us to achieve &Ogr;(min(n3, n5/3 m2/3, nm log n) log (nC)) running time.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786692","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}
引用次数: 255
Properties that characterize LOGCFL 表征LOGCFL的属性
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28411
Logcfl H Venkatcswaran
{"title":"Properties that characterize LOGCFL","authors":"Logcfl H Venkatcswaran","doi":"10.1145/28395.28411","DOIUrl":"https://doi.org/10.1145/28395.28411","url":null,"abstract":"Two properties, called semi-unboundedness, and polynomial proof-size, are identified as key properties shared by the definitions of LOGCFL on several models of computations. The semi-unboundedness property leads to the definition of new models of computation based on unbounded fan-in circuits. These are circuits obtained from unbounded fan-in circuits by restricting the fan-in of gates of one type. A new characterization of LOGCFL is obtained on such a model in which the fan-in of the AND gates are bounded by a constant. This property also suggests new characterizations of LOGCFL on the following models: alternating Turing machines [CKS81], nondeterministic auxiliary pushdown automata [Co71], and bounded fan-in Boolean circuits [Co85].","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124041250","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}
引用次数: 162
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems 最优分布式算法的最小权值生成树，计数，领导选举和相关问题
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28421
B. Awerbuch
{"title":"Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems","authors":"B. Awerbuch","doi":"10.1145/28395.28421","DOIUrl":"https://doi.org/10.1145/28395.28421","url":null,"abstract":"This paper develops linear time distributed algorithms for a class of problems in an asynchronous communication network. Those problems include Minimum-Weight Spanning Tree (MST), Leader Election, counting the number of network nodes, and computing a sensitive decomposable function (e.g. majority, parity, maximum, OR, AND). The main problem considered is the problem of finding the MST. This problem, which has been known for at least 9 years, is one of the most fundamental and the most studied problems in the field of distributed network algorithms. Any algorithm for any one of the problems above requires at least &OHgr;(E + VlogV) communication and &OHgr;(V) time in the general network. In this paper, we present new algorithms, which achieve those lower bounds. The best previous algorithm requires &THgr;(E + VlogV) in communication and &THgr;(V log V) in time. Our result enables to improve algorithms for many other problems in distributed computing, achieving lower bounds on their communication and time complexities.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130621901","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}
引用次数: 378
Permutation groups in NC NC中的排列群
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28439
L. Babai, E. Luks, Á. Seress
{"title":"Permutation groups in NC","authors":"L. Babai, E. Luks, Á. Seress","doi":"10.1145/28395.28439","DOIUrl":"https://doi.org/10.1145/28395.28439","url":null,"abstract":"We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a composition series of G along with permutation representations of each composition factor. Moreover, given G, we are able to find the pointwise stabilizer of a set in NC. One consequence is that isomorphism of graphs with bounded multiplicity of eigenvalues is in NC. The analysis of the algorithms depends, in several ways, on consequences of the classification of finite simple groups.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129209102","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}
引用次数: 115
Two algorithms for maintaining order in a list 维护列表中顺序的两种算法
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28434
Paul F. Dietz, D. Sleator
{"title":"Two algorithms for maintaining order in a list","authors":"Paul F. Dietz, D. Sleator","doi":"10.1145/28395.28434","DOIUrl":"https://doi.org/10.1145/28395.28434","url":null,"abstract":"The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list). We give two new algorithms for this problem. The first algorithm matches the O(1) amortized time per operation of the best previously known algorithm, and is much simpler. The second algorithm permits all operations to be performed in O(1) worst-case time.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132447770","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}
引用次数: 354
An optimal online algorithm for metrical task systems 度量任务系统的最优在线算法
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28435
A. Borodin, N. Linial, M. Saks
{"title":"An optimal online algorithm for metrical task systems","authors":"A. Borodin, N. Linial, M. Saks","doi":"10.1145/28395.28435","DOIUrl":"https://doi.org/10.1145/28395.28435","url":null,"abstract":"In practice, almost all dynamic systems require decisions to be made online, without full knowledge of their future impact on the system. We introduce a general model for the processing of sequences of tasks and develop a general online decision algorithm. We show that, for an important class of special cases, this algorithm is optimal among all online algorithms. Specifically, a task system (S, d) for processing sequences of tasks consists of a set S of states and a cost matrix d where d(i, j) is the cost of changing from state i to state j (we assume that d satisfies the triangle inequality and all diagonal entries are O.) The cost of processing a given task depends on the state of the system. A schedule for a sequence T1, T2 … Tk of tasks is a sequence s1, s2 … sk of states where si is the state in which Ti is processed; the cost of a schedule is the sum of all task processing costs and state transition costs incurred. An online scheduling algorithm is one that chooses si only knowing T1 T2 … Ti. Such an algorithm operates within waste factor w if, on any input task sequence, its costs is within an additive constant of w times the optimal offline schedule cost. The online waste factor w(S, d) is the infirm waste factor of any online scheduling algorithm for (S, d). We show that w(S, d) = 2|S| - 1 for every task system in which d symmetric, and w(S, d) = &Ogr;(|S|2) for every task system.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128324619","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}
引用次数: 244
Testing for cycles in infinite graphs with periodic structure 具有周期结构的无限图中循环的检验
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28401
Kazuo Iwano, K. Steiglitz
{"title":"Testing for cycles in infinite graphs with periodic structure","authors":"Kazuo Iwano, K. Steiglitz","doi":"10.1145/28395.28401","DOIUrl":"https://doi.org/10.1145/28395.28401","url":null,"abstract":"A k-dimensional dynamic graph is obtained by repeating a basic: cell in a kdimensional orthogonal grid. The nodses in each cell are connected to a finite number of nodes in other cells, and, furthermore, the pattern of the inter-cell connections is the same for each cell. Thus, a dynamic gra.ph is a finitely described infinite graph, w:ith a periodic structure. In this paper we study the problem of deciding whether a given twodimensional dynamic graph has a directed cycle.","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127209207","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}
引用次数: 52
Algebraic methods in the theory of lower bounds for Boolean circuit complexity 布尔电路复杂度下界理论中的代数方法
Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28404
R. Smolensky
{"title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","authors":"R. Smolensky","doi":"10.1145/28395.28404","DOIUrl":"https://doi.org/10.1145/28395.28404","url":null,"abstract":"We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in circuits with the given set of basic operations. In particular, we prove that depth k circuits with gates NOT, OR and MODp where p is a prime require Exp(&Ogr;(n1/2k)) gates to calculate MODr functions for any r ≠ pm. This statement contains as special cases Yao's PARITY result [ Ya 85 ] and Razborov's new MAJORITY result [Ra 86] (MODm gate is an oracle which outputs zero, if the number of ones is divisible by m).","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123123433","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}
引用次数: 876
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信