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

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

筛选
英文 中文
Diversity-based inference of finite automata 有限自动机的基于多样性的推理
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1994-05-01 DOI: 10.1145/176584.176589
R. Rivest, R. Schapire
{"title":"Diversity-based inference of finite automata","authors":"R. Rivest, R. Schapire","doi":"10.1145/176584.176589","DOIUrl":"https://doi.org/10.1145/176584.176589","url":null,"abstract":"We present a new procedure for inferring the structure of a finitestate automaton (FSA) from its input/output behavior, using access to the automaton to perform experiments. Our procedure uses a new representation for FSA's, based on the notion of equivalence between testa. We call the number of such equivalence classes the diversity of the automaton; the diversity may be as small as the logarithm of the number of states of the automaton. The size of our representation of the FSA, and the running time of our procedure (in some case provably, in others conjecturally) is polynomial in the diversity and ln(1/ε), where ε is a given upper bound on the probability that our procedure returns an incorrect result. (Since our procedure uses randomization to perform experiments, there is a certain controllable chance that it will return an erroneous result.) We also present some evidence for the practical efficiency of our approach. For example, our procedure is able to infer the structure of an automaton based on Rubik's Cube (which has approximately 1019 states) in about 2 minutes on a DEC Micro Vax. This automaton is many orders of magnitude larger than possible with previous techniques, which would require time proportional at least to the number of global states. (Note that in this example, only a small fraction (10-14) of the global states were even visited.)","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131291201","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}
引用次数: 136
Cascading divide-and-conquer: A technique for designing parallel algorithms 级联分治:一种设计并行算法的技术
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1989-06-01 DOI: 10.1109/SFCS.1987.12
M. Atallah, R. Cole, M. Goodrich
{"title":"Cascading divide-and-conquer: A technique for designing parallel algorithms","authors":"M. Atallah, R. Cole, M. Goodrich","doi":"10.1109/SFCS.1987.12","DOIUrl":"https://doi.org/10.1109/SFCS.1987.12","url":null,"abstract":"We present techniques for parallel divide-and-conquer, resulting in improved parallel algorithms for a number of problems. The problems for which we give improved algorithms include intersection detection, trapezoidal decomposition (hence, polygon triangulation), and planar point location (hence, Voronoi diagram construction). We also give efficient parallel algorithms for fractional cascading, 3-dimensional maxima, 2-set dominance counting, and visibility from a point. All of our algorithms run in O(log n) time with either a linear or sub-linear number of processors in the CREW PRAM model.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130308376","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}
引用次数: 223
Random self-reducibility and zero knowledge interactive proofs of possession of information 信息占有的随机自约性和零知识交互证明
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.49
M. Tompa, H. Woll
{"title":"Random self-reducibility and zero knowledge interactive proofs of possession of information","authors":"M. Tompa, H. Woll","doi":"10.1109/SFCS.1987.49","DOIUrl":"https://doi.org/10.1109/SFCS.1987.49","url":null,"abstract":"The notion of a zero knowledge interactive proof that one party \"knows\" some secret information is explored. It is shown that any \"random self-reducible\" problem has a zero knowledge interactive proof of this sort. The zero knowledge interactive proofs for graph isomorphism, quadratic residuosity, and \"knowledge\" of discrete logarithms all follow as special cases. Based on these results, new zero knowledge interactive proofs are exhibited for \"knowledge\" of the factorization of an integer, nonmembership in cyclic subgroups of Zp*, and determining whether an element generates Zp*. None of these proofs relies on any unproven assumptions.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"55 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":"126637301","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}
引用次数: 240
Learning one-counter languages in polynomial time 在多项式时间内学习单计数器语言
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.36
P. Berman, R. Roos
{"title":"Learning one-counter languages in polynomial time","authors":"P. Berman, R. Roos","doi":"10.1109/SFCS.1987.36","DOIUrl":"https://doi.org/10.1109/SFCS.1987.36","url":null,"abstract":"We demonstrate that the class of languages accepted by deterministic one-counter machines, or DOCAs (a natural subset of the context-free languages), is learnable in polynomial time. Our learning protocol is based upon Angluin's concept of a \"minimally adequate teacher\" who can answer membership queries about a concept and provide counterexamples to incorrect hypothesized concepts. We also demonstrate that the problem of testing DOCAs for equivalence may be solved in polynomial time, answering a question posed by Valiant and Paterson.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"28 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":"123878057","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}
引用次数: 54
Secret linear congruential generators are not cryptographically secure 秘密线性同余生成器在密码上是不安全的
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.51
J. Stern
{"title":"Secret linear congruential generators are not cryptographically secure","authors":"J. Stern","doi":"10.1109/SFCS.1987.51","DOIUrl":"https://doi.org/10.1109/SFCS.1987.51","url":null,"abstract":"This paper discusses the predictability of the sequence given by outputing a constant proportion α of the leading bits of the numbers produced by a linear congruential generator. First, we make the assumption that the modulus of the generator is the only known parameter and we prove that, almost surely, a significant proportion of the bits can be predicted from the previous ones, once the generator has been used K times successively where K is O(√log m). Next, we assume that all parameters of the generator are secret and we show how repeated observations of sequences of outputs of length K will probably allow an opponent to cryptanalyze the full sequence.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"575 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":"116260111","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}
引用次数: 89
Distributive graph algorithms Global solutions from local data 分布式图算法从本地数据的全局解决方案
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.20
N. Linial
{"title":"Distributive graph algorithms Global solutions from local data","authors":"N. Linial","doi":"10.1109/SFCS.1987.20","DOIUrl":"https://doi.org/10.1109/SFCS.1987.20","url":null,"abstract":"This paper deals with distributed graph algorithms. Processors reside in the vertices of a graph G and communicate only with their neighbors. The system is synchronous and reliable, there is no limit on message lengths and local computation is instantaneous. The results: A maximal independent set in an n-cycle cannot be found faster than Ω(log* n) and this is optimal by [CV]. The d-regular tree of radius r cannot be colored with fewer than √d colors in time 2r / 3. If Δ is the largest degree in G which has order n, then in time O(log*n) it can be colored with O(Δ2) colors.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"3 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":"127722130","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}
引用次数: 209
Interactive proof systems: Provers that never fail and random selection 交互式证明系统:永远不会失败的证明和随机选择
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.35
Oded Goldreich, Y. Mansour, M. Sipser
{"title":"Interactive proof systems: Provers that never fail and random selection","authors":"Oded Goldreich, Y. Mansour, M. Sipser","doi":"10.1109/SFCS.1987.35","DOIUrl":"https://doi.org/10.1109/SFCS.1987.35","url":null,"abstract":"An interactive proof system with Perfect Completeness (resp. Perfect Soundness) for a language L is an interactive proof (for L) in which for every x ∈ L (resp. x ∉ L) the verifier always accepts (resp. always rejects). Zachos and Fuerer showed that any language having a bounded interactive proof has one with perfect completeness. We extend their result and show that any language having a (possibly unbounded) interactive proof system has one with perfect completeness. On the other hand, only languages in NP have interactive proofs with perfect soundness. We present two proofs of the main result. One proof extends Lautemann's proof that BPP is in the polynomial-time hierarchy. The other proof, uses a new protocol for proving approximately lower bounds and \"random selection\". The problem of random selection consists of a verifier selecting at random, with uniform probability distribution, an element from an arbitrary set held by the prover. Previous protocols known for approximate lower bound do not solve the random selection problem. Interestingly, random selection can be implemented by an unbounded Arthur-Merlin game but can not be implemented by a two-iteration game.","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":"125770876","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}
引用次数: 61
Parallel graph algorithms that are efficient on average 平均效率高的并行图算法
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.46
D. Coppersmith, P. Raghavan, M. Tompa
{"title":"Parallel graph algorithms that are efficient on average","authors":"D. Coppersmith, P. Raghavan, M. Tompa","doi":"10.1109/SFCS.1987.46","DOIUrl":"https://doi.org/10.1109/SFCS.1987.46","url":null,"abstract":"The following three problems concerning random graphs can be solved in (log n)O(1) expected time using linearly many processors: (1) finding the lexicographically first maximal independent set, (2) coloring the vertices using a number of colors that is almost surely within twice the chromatic number, and (3) finding a Hamiltonian circuit.","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":"130423934","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}
引用次数: 38
On the second eigenvalue of random regular graphs 关于随机正则图的第二特征值
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.45
A. Broder, E. Shamir
{"title":"On the second eigenvalue of random regular graphs","authors":"A. Broder, E. Shamir","doi":"10.1109/SFCS.1987.45","DOIUrl":"https://doi.org/10.1109/SFCS.1987.45","url":null,"abstract":"Expanders have many applications in Computer Science. It is known that random d-regular graphs are very efficient expanders, almost surely. However, checking whether a particular graph is a good expander is co-NP-complete. We show that the second eigenvalue of d-regular graphs, λ2, is concentrated in an interval of width O(√d) around its mean, and that its mean is O(d3/4). The result holds under various models for random d-regular graphs. As a consequence a random d-regular graph on n vertices, is, with high probability a certifiable efficient expander for n sufficiently large. The bound on the width of the interval is derived from martingale theory and the bound on E(λ2) is obtained by exploring the properties of random walks in random graphs.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"123 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":"114082328","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}
引用次数: 269
The multiplicative complexity of quadratic Boolean functions 二次布尔函数的乘法复杂度
28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.57
R. Mirwald, C. Schnorr
{"title":"The multiplicative complexity of quadratic Boolean functions","authors":"R. Mirwald, C. Schnorr","doi":"10.1109/SFCS.1987.57","DOIUrl":"https://doi.org/10.1109/SFCS.1987.57","url":null,"abstract":"Let the multiplicative complexity L(f) of a boolean function f be the minimal number of ∧-gates that are sufficient to evaluate f by circuits over the basis ∧,⊕,1. We give a polynomial time algorithm which for quadratic boolean forms f=⊕i≠jaijxixj determines L(f) from the coefficients aij. Two quadratic forms f,g have the same complexity L(f) = L(g) iff they are isomorphic by a linear isomorphism. We also determine the multiplicative complexity of pairs of quadratic boolean forms. We give a geometric interpretation to the complexity L(f1,f2) of pairs of quadratic forms.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"124 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":"128084264","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}
引用次数: 3
下一页 尾页
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学术官方微信