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

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

筛选
英文 中文
An analysis of the full alpha-beta pruning algorithm 完整的α - β剪枝算法分析
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804359
G. Baudet
{"title":"An analysis of the full alpha-beta pruning algorithm","authors":"G. Baudet","doi":"10.1145/800133.804359","DOIUrl":"https://doi.org/10.1145/800133.804359","url":null,"abstract":"An analysis of the alpha-beta pruning algorithm is presented which takes into account both shallow and deep cut-offs. A formula is first developed to measure the average number of terminal nodes examined by the algorithm in a uniform free of degree n and depth d when ties are allowed among the bottom positions: specifically, all bottom values are assumed to be independent identically distributed random variables drawn from a discrete probability distribution. A worst case analysis over all possible probability distributions is then presented by considering the limiting case when the discrete probability distribution tends to a continuous probability distribution. The branching factor of the alpha-beta pruning algorithm is shown to grow with n as &THgr;(n/In n), therefore confirming a claim by Knuth and Moore that deep cut-offs only have a second order effect on the behavior of the algorithm.","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":"114139743","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}
引用次数: 13
Proceedings of the tenth annual ACM symposium on Theory of computing 第十届ACM计算理论年会论文集
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133
M. Fischer, R. DeMillo, N. Lynch, W. Burkhard, A. Aho
{"title":"Proceedings of the tenth annual ACM symposium on Theory of computing","authors":"M. Fischer, R. DeMillo, N. Lynch, W. Burkhard, A. Aho","doi":"10.1145/800133","DOIUrl":"https://doi.org/10.1145/800133","url":null,"abstract":"","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":"130990638","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}
引用次数: 19
Propositional representation of arithmetic proofs (Preliminary Version) 算术证明的命题表示(初版)
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804354
M. Dowd
{"title":"Propositional representation of arithmetic proofs (Preliminary Version)","authors":"M. Dowd","doi":"10.1145/800133.804354","DOIUrl":"https://doi.org/10.1145/800133.804354","url":null,"abstract":"Equations f@@@@ = g@@@@ between polynomial time computable functions can be represented by sets of propositional formulas. If f@@@@ = g@@@@ is provable in certain arithmetic systems, then polynomial length proofs of the representing formulas exist in certain propositional systems. Two cases of this phenomenon and a general theory are given.","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":"117147043","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
Coping with errors in binary search procedures (Preliminary Report) 处理二分查找程序中的错误(初步报告)
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804351
R. Rivest, A. Meyer, D. Kleitman, Karl Winklmann, J. Spencer
{"title":"Coping with errors in binary search procedures (Preliminary Report)","authors":"R. Rivest, A. Meyer, D. Kleitman, Karl Winklmann, J. Spencer","doi":"10.1145/800133.804351","DOIUrl":"https://doi.org/10.1145/800133.804351","url":null,"abstract":"We consider the problem of identifying an unknown value x&egr;{1,2,...,n} using only comparisons of x to constants when as many as E of 'the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. This strategy for the continuous problem is then shown to yield a strategy for the original discrete problem that uses log2n+E.log2log2n+O(E.log2E) comparisons in the worst case. This number is shown to be optimal even if arbitrary “Yes-No” questions are allowed. We show that a modified version of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity log2n+E.log2log2n+0(E.log2E).","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":"122824307","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
The macro model for data compression (Extended Abstract) 数据压缩的宏模型(扩展摘要)
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804329
J. Storer, T. G. Szymanski
{"title":"The macro model for data compression (Extended Abstract)","authors":"J. Storer, T. G. Szymanski","doi":"10.1145/800133.804329","DOIUrl":"https://doi.org/10.1145/800133.804329","url":null,"abstract":"A general model for data compression is presented which includes most data compression systems in the literature as special cases. All macro schemes are based on the principle of finding redundant strings or patterns and replacing them by pointers to a common copy. Different varieties of macro schemes may be defined by varying the interpretation of pointers, for instance, a pointer may indicate a substring of the compressed string, a substring of the original string, or a substring of some other string such as an external dictionary. Other varieties of macros schemes may be defined by restricting the type of overlapping or recursion that may be used. Trade-offs between different varieties of macro schemes, exact lower bounds on the amount of compression obtainable, and the complexity of encoding and decoding are discussed as well as how the work of other authors (such as Lempel-Ziv) relates to this model.","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":"122892379","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}
引用次数: 58
On the complexity of the Maximum Subgraph Problem 最大子图问题的复杂性
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804356
John M. Lewis
{"title":"On the complexity of the Maximum Subgraph Problem","authors":"John M. Lewis","doi":"10.1145/800133.804356","DOIUrl":"https://doi.org/10.1145/800133.804356","url":null,"abstract":"For a fixed graph property, the Maximum Subgraph Recognition Problem for the property is: Given a graph G and integer k, does G have a subgraph induced by k vertices which satisfies the property. This paper studies the complexity of this problem for various properties. The principal result is that if the property is any one of a wide class of monotone properties, the Maximum Subgraph Problem is NP-hard. This suggests a promising direction of inquiry into the P = ?NP question.","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":"132378852","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}
引用次数: 35
Parallelism in random access machines 随机存取机的并行性
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804339
S. Fortune, J. Wyllie
{"title":"Parallelism in random access machines","authors":"S. Fortune, J. Wyllie","doi":"10.1145/800133.804339","DOIUrl":"https://doi.org/10.1145/800133.804339","url":null,"abstract":"A model of computation based on random access machines operating in parallel and sharing a common memory is presented. The computational power of this model is related to that of traditional models. In particular, deterministic parallel RAM's can accept in polynomial time exactly the sets accepted by polynomial tape bounded Turing machines; nondeterministic RAM's can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines. Similar results hold for other classes. The effect of limiting the size of the common memory is also considered.","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":"132430864","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}
引用次数: 1005
On time-space classes and their relation to the theory of real addition 论时空类及其与实加法理论的关系
Proceedings of the tenth annual ACM symposium on Theory of computing Pub Date : 1978-05-01 DOI: 10.1145/800133.804352
Anna R. Bruss, A. Meyer
{"title":"On time-space classes and their relation to the theory of real addition","authors":"Anna R. Bruss, A. Meyer","doi":"10.1145/800133.804352","DOIUrl":"https://doi.org/10.1145/800133.804352","url":null,"abstract":"A new lower bound on the computational complexity of the theory of real addition and several related theories is established: any decision procedure for these theories requires either space 2&egr;n or nondeterministic time 2&egr;n2 for some constant &egr; > O and infinitely many n. The proof is based on the families of languages TISP(T(n),S(n)) which can be recognized simultaneously in time T(n) and space S(n) and the conditions under which they form a hierarchy.","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":"129231562","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}
引用次数: 39
首页 上一页
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学术官方微信