Proceedings of the nineteenth annual ACM symposium on Theory of computing最新文献_第5页

Reconfiguring a hypercube in the presence of faults 在存在故障的情况下重新配置超立方体

Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28425

J. Håstad, F. Leighton, M. Newman

引用次数: 119

Threshold spectra for random graphs 随机图的阈值谱

Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28440

S. Shelah, J. Spencer

引用次数: 8

Parallel symmetry-breaking in sparse graphs 稀疏图中的平行对称破缺

Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28429

A. Goldberg, Serge A. Plotkin, Gregory E. Shannon

引用次数: 359

On the learnability of Boolean formulae 布尔公式的可学习性

Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28426

M. Kearns, Ming Li, L. Pitt, L. Valiant

{"title":"On the learnability of Boolean formulae","authors":"M. Kearns, Ming Li, L. Pitt, L. Valiant","doi":"10.1145/28395.28426","DOIUrl":"https://doi.org/10.1145/28395.28426","url":null,"abstract":"We study the computational feasibility of learning boolean expressions from examples. Our goals are to prove results and develop general techniques that shed light on the boundary between the classes of expressions that are learnable in polynomial time and those that are apparently not. The elucidation of this boundary, for boolean expressions and possibly other knowledge representations, is an example of the potential contribution of complexity theory to artificial intelligence. We employ the distribution-free model of learning introduced in /lo]. A more complete discussion and justification of this model can be found in [4,10,11,12]. [4] includes some discussion that is relevant more particularly to infinite representations, such as geometric ones, rather than the finite case of boolean functions. For other recent related work see [1,2,7,&g]. The results of this paper fall into three categories: closure properties of learnable classes, negative results, and distribution-specific positive results. The closure properties are of two kinds. In section 3 we discuss closure under boolean operations on the members of the learnable classes. The assumption that the classes are learnable from positive or negative ex-","PeriodicalId":161795,"journal":{"name":"Proceedings of the nineteenth annual ACM symposium on Theory of computing","volume":"183 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":"121939010","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}

引用次数: 315

The page number of genus g graphs is (g) g属图的页码为(g)

Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1987-01-01 DOI: 10.1145/28395.28437

Lenwood S. Heath, S. Istrail

引用次数: 8

Proceedings of the nineteenth annual ACM symposium on Theory of computing 第十九届ACM计算理论年会论文集

Proceedings of the nineteenth annual ACM symposium on Theory of computing Pub Date : 1900-01-01 DOI: 10.1145/28395

A. Aho

引用次数: 26