关于证明电路尺寸的下界

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI:10.1109/SCT.1993.336535

M. Karchmer

{"title":"关于证明电路尺寸的下界","authors":"M. Karchmer","doi":"10.1109/SCT.1993.336535","DOIUrl":null,"url":null,"abstract":"A.A. Razborov's (1989) generalized approximation method, which has the potential of giving tight lower bounds for circuit size, is considered. The method is described in a more intuitive fashion, and its analogy with the ultraproduct construction in model theory is made explicit. The method is extended so that it can be used to lower bound nondeterministic circuit size. Using the proposed framework, a new proof for the exponential monotone size lower bound for the clique function is presented.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"On proving lower bounds for circuit size\",\"authors\":\"M. Karchmer\",\"doi\":\"10.1109/SCT.1993.336535\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A.A. Razborov's (1989) generalized approximation method, which has the potential of giving tight lower bounds for circuit size, is considered. The method is described in a more intuitive fashion, and its analogy with the ultraproduct construction in model theory is made explicit. The method is extended so that it can be used to lower bound nondeterministic circuit size. Using the proposed framework, a new proof for the exponential monotone size lower bound for the clique function is presented.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1993.336535\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1993.336535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

考虑了A.A. Razborov(1989)的广义近似方法，该方法有可能给出电路尺寸的严格下界。以一种更直观的方式描述了该方法，并明确了它与模型理论中的超积构造的类比。对该方法进行了扩展，使其可用于求解不确定性电路尺寸的下界问题。利用所提出的框架，给出了团函数的指数单调大小下界的一个新的证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On proving lower bounds for circuit size

A.A. Razborov's (1989) generalized approximation method, which has the potential of giving tight lower bounds for circuit size, is considered. The method is described in a more intuitive fashion, and its analogy with the ultraproduct construction in model theory is made explicit. The method is extended so that it can be used to lower bound nondeterministic circuit size. Using the proposed framework, a new proof for the exponential monotone size lower bound for the clique function is presented.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量