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

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)最新文献

筛选
英文 中文
On the security of public key protocols 论公钥协议的安全性
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1983-03-01 DOI: 10.1109/TIT.1983.1056650
D. Dolev, A. Yao
{"title":"On the security of public key protocols","authors":"D. Dolev, A. Yao","doi":"10.1109/TIT.1983.1056650","DOIUrl":"https://doi.org/10.1109/TIT.1983.1056650","url":null,"abstract":"Recently the use of public key encryption to provide secure network communication has received considerable attention. Such public key systems are usually effective against passive eavesdroppers, who merely tap the lines and try to decipher the message. It has been pointed out, however, that an improperly designed protocol could be vulnerable to an active saboteur, one who may impersonate another user or alter the message being transmitted. Several models are formulated in which the security of protocols can be discussed precisely. Algorithms and characterizations that can be used to determine protocol security in these models are given.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124810482","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}
引用次数: 5297
On the number of P-isomorphism classes of NP-complete sets 关于np完全集的p同构类的个数
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.30
Stephen R. Mahaney
{"title":"On the number of P-isomorphism classes of NP-complete sets","authors":"Stephen R. Mahaney","doi":"10.1109/SFCS.1981.30","DOIUrl":"https://doi.org/10.1109/SFCS.1981.30","url":null,"abstract":"All known NP-complete sets are P-isomorphic (i.e. there are polynomial time, one-to-one and onto, polynomial time invertible reductions between any two known NP-complete sets) [BH]. If all NP-complete sets are P-isomorphic, then. P ≠ NP. However it is not known if the existence of more than one P-isomorphism class of NP-complete sets has implications for the P = NP? problem. In the main result of this paper we prove: Theorem: If there is an NP-complete set that is not P-isomorphic to SAT, then there are infinitely many NP-complete sets that are mutually non-P-isomorphic. Thus, the number of P-isomorphism classes of NP-complete sets is either one or (countably) infinite. Two proof techniques are developed in this paper: we use delayed diagonalization [BCH, L] to construct new sets that are not P-isomorphic to existing sets; the diagonalization conditions are used to defeat P-isomorphisms. We also examine certain properties of 'generic' NP-complete sets and introduce techniques based on padding functions to assure that the sets constructed will be NP-complete. The results on P-isomorphisms and constructing non-P-isomorphic sets apply also to sets complete for PTAPE, EXPTIME, and EXPTAPE and other classes. We also examine the structure of NP-complete sets based on size increasing, invertible reductions, The degrees are P-isomorphism classes [BH]. We show that if there is more than one degree, then there is an ω chain of degrees with SAT representing a maximal element.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124883273","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}
引用次数: 12
On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata 无二义正则表达式、语法和自动机的等价性和包含问题
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.29
R. Stearns, H. Hunt
{"title":"On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata","authors":"R. Stearns, H. Hunt","doi":"10.1109/SFCS.1981.29","DOIUrl":"https://doi.org/10.1109/SFCS.1981.29","url":null,"abstract":"The known proofs that the equivalence and containment problems for the regular and for the linear context-free grammars are PSPACE-complete and undecidable, respecitvely, depend upon consideration of ambiguous grammars. We prove that this dependence is inherent. Deterministic polynomial time algorithms are presented for; (1) the equivalence and containment problems for the unambiguous regular grammars; (2) for all k ≥ 2, the equivalence and containment problems for the regular grammars of degree of ambiguity ≤ k; and (3) the problems of determining if an unambiguous linear context-free grammar is equivalent to or contains an arbitrary regular set. Simple extensions of the grammar classes in (1), (2), and (3) are shown to yield problems that are NP-hard or undecidable. Several new results on the relative economy of description of ambiguous versus unambiguous regular and linear contextfree grammars are also obtained. These results depend upon several observations on the solutions of systems of homogeneous linear difference equations and their relationship with the number of strings of a given length generated by an unambiguous regular or linear context-free grammar.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121231578","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}
引用次数: 40
Global decision problems for relational databases 关系数据库的全局决策问题
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.18
Moshe Y. Vardi
{"title":"Global decision problems for relational databases","authors":"Moshe Y. Vardi","doi":"10.1109/SFCS.1981.18","DOIUrl":"https://doi.org/10.1109/SFCS.1981.18","url":null,"abstract":"Database dependencies are first-order sentences describing the semantics of databases. Decision problems concerning dependencies divide into local problem, such as whether a set of dependencies logically implies another dependency, and global problems, such as whether a set of dependencies is redundant. In this paper we investigate global problems, that of recognizing properties of sets of dependencies. The main result is a negative result in the spirit of Adjan-Markov-Rabin result for global properties of finitely presented semigroups and groups. We show that the decision problem for any property which is wellbehaved in a certain sense (specifically, if it is nice, non-trivial and hereditary) is recursively unsolvable.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116176128","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}
引用次数: 8
A decidable mu-calculus: Preliminary report 一个可确定的微积分:初步报告
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.4
V. Pratt
{"title":"A decidable mu-calculus: Preliminary report","authors":"V. Pratt","doi":"10.1109/SFCS.1981.4","DOIUrl":"https://doi.org/10.1109/SFCS.1981.4","url":null,"abstract":"We describe a mu-calculus which amounts to modal logic plus a minimization operator, and show that its satisfiability problem is decidable in exponential time. This result subsumes corresponding results for propositional dynamic logic with test and converse, thus supplying a better setting for those results. It also encompasses similar results for a logic of flowgraphs. This work provides an intimate link between PDL as defined by the Segerberg axioms and the mu-calculi of de Bakker and Park.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123612692","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
A direct dynamic solution to range search and related problems for product regions 直接动态解决产品区域范围搜索和相关问题
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.5
Z. Aviad, E. Shamir
{"title":"A direct dynamic solution to range search and related problems for product regions","authors":"Z. Aviad, E. Shamir","doi":"10.1109/SFCS.1981.5","DOIUrl":"https://doi.org/10.1109/SFCS.1981.5","url":null,"abstract":"A simple property of number representations yields a unit cross section relation between points and interval representations. Applied to product regions in a vector space, one obtains simple, practical and flexible algorithms for dynamic range search and related queries.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749286","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}
引用次数: 7
Irreducibility testing and factorization of polynomials 多项式的不可约性检验与因子分解
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.20
L. Adleman, A. Odlyzko
{"title":"Irreducibility testing and factorization of polynomials","authors":"L. Adleman, A. Odlyzko","doi":"10.1109/SFCS.1981.20","DOIUrl":"https://doi.org/10.1109/SFCS.1981.20","url":null,"abstract":"It is shown that under certain hypotheses, irreducibility testing and factorization of polynomials with integer coefficients are polynomial time reducible to primality testing and factorization of integers, respectively. Combined with recently discovered fast primality tests, this yields an almost polynomial time irreducibility algorithm. The assertions of irreducibility produced by this algorithm are always certain and yield short proofs of irreducibility.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124919306","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
Maximum matching in sparse random graphs 稀疏随机图中的最大匹配
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.21
R. Karp, M. Sipser
{"title":"Maximum matching in sparse random graphs","authors":"R. Karp, M. Sipser","doi":"10.1109/SFCS.1981.21","DOIUrl":"https://doi.org/10.1109/SFCS.1981.21","url":null,"abstract":"","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133467545","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
Propositional dynamic logic of context-free programs 上下文无关程序的命题动态逻辑
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1109/SFCS.1981.38
D. Harel, A. Pnueli, J. Stavi
{"title":"Propositional dynamic logic of context-free programs","authors":"D. Harel, A. Pnueli, J. Stavi","doi":"10.1109/SFCS.1981.38","DOIUrl":"https://doi.org/10.1109/SFCS.1981.38","url":null,"abstract":"The borderline between decidable and undecidable Propositional Dynamic Logic (PDL) is sought when iterative programs represented by regular expressions are augmented with increasingly more complex recursive programs represented by context-free languages. The results in this paper and its companion [HPS] indicate that this line is extremely close to the original regular PDL. The main result of the present paper is: The validity problem for PDL with additional programs αΔ(β)γΔ for regular α, β and γ, defined as Uiαi; β; γi, is Π11-complete. One of the results of [HPS] shows that the single program AΔ(B) AΔ for atomic A and B is actually sufficient for obtaining Π11- completeness. However, the proofs of this paper use different techniques which seem to be worthwhile in their own right.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121785195","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}
引用次数: 12
Two-way counter machines and Diophantine equations 双向计数器和丢番图方程
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Pub Date : 1981-10-28 DOI: 10.1145/322326.322340
E. Gurari, O. Ibarra
{"title":"Two-way counter machines and Diophantine equations","authors":"E. Gurari, O. Ibarra","doi":"10.1145/322326.322340","DOIUrl":"https://doi.org/10.1145/322326.322340","url":null,"abstract":"Let Q be the class of deterministic two-way one-counter machines accepting only bounded languages. Each machine in Q has the property that in every accepting computation, the counter makes at most a fixed number of reversals. We show that the emptiness problem for Q is decidable. When the counter is unrestricted or when the machine is provided with two reversal-bounded counters, the emptiness problem becomes undecidable. The decidability of the emptiness problem for Q is useful in proving the solvability of some numbertheoretic problems. It can also be used to prove that the language L = {u1iu2i2|i≥0} cannot be accepted by any machine in Q (u1 and u2 are distinct symbols). The proof technique is new in that it does not employ the usual \"pumping\", \"counting\", or \"diagonal\" argument. Note that L can be accepted by a deterministic two-way machine with two counters, each of which makes exactly one reversal.","PeriodicalId":224735,"journal":{"name":"22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124119929","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}
引用次数: 41
下一页 尾页
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学术官方微信