具有两次读的常量宽度分支程序的函数不一定是可测试的

Proceedings 17th IEEE Annual Conference on Computational Complexity Pub Date : 2002-05-21 DOI:10.1109/CCC.2002.1004342

E. Fischer, I. Newman, J. Sgall

{"title":"具有两次读的常量宽度分支程序的函数不一定是可测试的","authors":"E. Fischer, I. Newman, J. Sgall","doi":"10.1109/CCC.2002.1004342","DOIUrl":null,"url":null,"abstract":"We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided /spl epsi/-testing algorithm must make at least /spl Omega/(n/sup 1/10/) many queries for some fixed small enough /spl epsi/. This shows that Newman's result (2000) cannot be generalized to read-k-times functions for k > 1.","PeriodicalId":193513,"journal":{"name":"Proceedings 17th IEEE Annual Conference on Computational Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Functions that have read-twice constant width branching programs are not necessarily testable\",\"authors\":\"E. Fischer, I. Newman, J. Sgall\",\"doi\":\"10.1109/CCC.2002.1004342\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided /spl epsi/-testing algorithm must make at least /spl Omega/(n/sup 1/10/) many queries for some fixed small enough /spl epsi/. This shows that Newman's result (2000) cannot be generalized to read-k-times functions for k > 1.\",\"PeriodicalId\":193513,\"journal\":{\"name\":\"Proceedings 17th IEEE Annual Conference on Computational Complexity\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 17th IEEE Annual Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2002.1004342\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 17th IEEE Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2002.1004342","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 37

摘要

我们在0/1-字符串上构造了一个属性，该属性由宽度为3的分支程序集合表示，但是对于任何2-sided /spl epsi/-测试算法必须对一些固定的足够小的/spl epsi/进行至少/spl Omega/(n/sup 1/10/)多次查询。这表明Newman的结果(2000)不能推广到k > 1的读k次函数。

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

查看原文本刊更多论文

Functions that have read-twice constant width branching programs are not necessarily testable

We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided /spl epsi/-testing algorithm must make at least /spl Omega/(n/sup 1/10/) many queries for some fixed small enough /spl epsi/. This shows that Newman's result (2000) cannot be generalized to read-k-times functions for k > 1.

求助全文

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

来源期刊

Proceedings 17th IEEE Annual Conference on Computational Complexity

自引率

0.00%

发文量