28th Annual Symposium on Foundations of Computer Science (sfcs 1987)最新文献_第3页

Database theory and cylindric lattices 数据库理论和圆柱格

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.17

S. Cosmadakis

引用次数: 12

Finding near optimal separators in planar graphs 在平面图中寻找接近最优的分隔符

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.26

Satish Rao

引用次数: 43

An output sensitive algorithm for computing visibility graphs 一种计算可见性图的输出敏感算法

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1137/0220055

S. Ghosh, D. Mount

引用次数: 349

The complexity of parallel comparison merging 并行比较合并的复杂性

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.55

Mihály Geréb-Graus, D. Krizanc

引用次数: 4

Some polynomial and Toeplitz matrix computations 一些多项式和Toeplitz矩阵的计算

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.52

V. Pan, J. Reif

{"title":"Some polynomial and Toeplitz matrix computations","authors":"V. Pan, J. Reif","doi":"10.1109/SFCS.1987.52","DOIUrl":"https://doi.org/10.1109/SFCS.1987.52","url":null,"abstract":"Part 1. Approximate Evaluation of Polynomial Zeros O(n2(1og2n+log b)) arithmetic operations or O( n(log2n+log b) parallel steps, n processors suffice in order to approximate with absolute error ~ 2mb to all the complex zeros of an n-th degree polynomial p(x) whose coefficients have moduli < 2m• If we only need such an approximation to a single zero of p(x), then O(n log n(n+log b)) arithmetic operations or O(log n(log2n+log b)) steps and n+n/(loin+log b) processors suffice (which places the latter problem in NC); furthermore if all the zeros are real, then we arrive at the bounds O(n log n(log3n+log b)), O(log n(log3+log b)), and n, respectively. Those estimates are reached in computations with O(nb) binary bits where the polynomial· has integer coefficients. This also implies a simple proof of the Boolean circuit complexity estimates for the approximation of all the complex zeros of p(x), announced in 1982 and partly proven by Schonhage. The computations rely on recursive application of Turan's proximity test of 1968, on its more recent extensions to root radii computations, and on contour integration via FFT within our modifications of the known geometric constructions for search and exclusion.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121591461","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}

引用次数: 14

Multiplicative complexity of polynomial multiplication over finite fields 有限域上多项式乘法的乘法复杂度

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1145/58562.59306

M. Kaminski, N. Bshouty

引用次数: 30

Perfect zero-knowledge languages can be recognized in two rounds 完美的零知识语言可以通过两轮识别

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.47

W. Aiello, J. Håstad

{"title":"Perfect zero-knowledge languages can be recognized in two rounds","authors":"W. Aiello, J. Håstad","doi":"10.1109/SFCS.1987.47","DOIUrl":"https://doi.org/10.1109/SFCS.1987.47","url":null,"abstract":"A hierarchy of probabilistic complexity classes generalizing NP has recently emerged in the work of [Ba], [GMR], and [GS]. The IP hierarchy is defined through the notion of an interactive proof system, in which an all powerful prover tries to convince a probabilistic polynomial time verifier that a string w is in a language L. The verifier tosses coins and exchanges messages back and forth with the prover before he decides whether to accept w. This proof-system yields \"probabilistic\" proofs: the verifier may erroneously accept or reject w with small probability. In [GMR] such a protocol was defined to be a zero-knowledge protocol if at the end of the interaction the verifier has learned nothing except that w ∈ L. We study complexity theoretic implications of a language having this property. In particular we prove that if L admits a zeroknowledge proof then L can also be recognized by a two round interactive proof. This complements a result by Fortnow [F] where it is proved that the complement of L has a two round interactive proof protocol. The methods of proof are quite similar to those of Fortnow [F]. As in his case the proof works under the assumption that the original protocol is only zero-knowledge with respect to a specific verifier.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128257314","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}

引用次数: 48

Polytope range searching and integral geometry 多边形范围搜索和积分几何

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.48

B. Chazelle

引用次数: 16

The average complexity of deterministic and randomized parallel comparison sorting algorithms 确定性和随机并行比较排序算法的平均复杂度

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1137/0217074

N. Alon, Y. Azar

引用次数: 37

On the cunning power of cheating verifiers: Some observations about zero knowledge proofs 论欺骗验证者的狡猾力量:关于零知识证明的一些观察

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.43

Yair Oren

{"title":"On the cunning power of cheating verifiers: Some observations about zero knowledge proofs","authors":"Yair Oren","doi":"10.1109/SFCS.1987.43","DOIUrl":"https://doi.org/10.1109/SFCS.1987.43","url":null,"abstract":"In this paper we investigate some properties of zero-knowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff. We introduce and classify various definitions of zero-knowledge. Two definitions which are of special interest are auxiliary-input zero-knowledge and blackbox-simulation zero-knowledge. We explain why auxiliary-input zero-knowledge is a definition more suitable for cryptographic applications than the original [GMR1] definition. In particular, we show that any protocol composed of subprotocols which are auxiliary-input zero-knowledge is itself auxiliary-input zero-knowledge. We show that blackbox simulation zero-knowledge implies auxiliary-input zeroknowledge (which in turn implies the [GMR1] definition). We argue that all known zero-knowledge proofs are in fact blackbox-simulation zero-knowledge (i.e. were proved zero-knowledge using blackbox-simulation of the verifier). As a result, all known zero-knowledge proof systems are shown to be auxiliary-input zero-knowledge and can be used for cryptographic applications such as those in [GMW2]. We demonstrate the triviality of certain classes of zero-knowledge proof systems, in the sense that only languages in BPP have zero-knowledge proofs of these classes. In particular, we show that any language having a Las vegas zeroknowledge proof system necessarily belongs to R. We show that randomness of both the verifier and the prover, and nontriviality of the interaction are essential properties of non-trivial auxiliary-input zero-knowledge proofs. In order to derive most of the results in the paper we make use of the full power of the definition of zero-knowledge: specifically, the requirement that there exist a simulator for any verifier, including \"cheating verifiers\".","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876736","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}

引用次数: 95