非随机化概率次线性时间算法

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) Pub Date : 2007-06-13 DOI:10.1109/CCC.2007.19

Marius Zimand

{"title":"非随机化概率次线性时间算法","authors":"Marius Zimand","doi":"10.1109/CCC.2007.19","DOIUrl":null,"url":null,"abstract":"There exists a positive constant alpha < 1 such that for any function T(n) les n alpha and for any problem L isin BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2-Omega (T(n) log T(n)) fraction of inputs of length n.","PeriodicalId":175854,"journal":{"name":"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On Derandomizing Probabilistic Sublinear-Time Algorithms\",\"authors\":\"Marius Zimand\",\"doi\":\"10.1109/CCC.2007.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There exists a positive constant alpha < 1 such that for any function T(n) les n alpha and for any problem L isin BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2-Omega (T(n) log T(n)) fraction of inputs of length n.\",\"PeriodicalId\":175854,\"journal\":{\"name\":\"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2007.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2007.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

存在一个正常数α < 1，使得对于任何函数T(n)小于n α和对于任何问题L在BPTIME(T(n))中，存在一个在poly(T(n))时间内运行的确定性算法，该算法决定L，除了长度为n的输入的最多2-Omega (T(n) log T(n))分数。

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

查看原文本刊更多论文

On Derandomizing Probabilistic Sublinear-Time Algorithms

There exists a positive constant alpha < 1 such that for any function T(n) les n ^alpha and for any problem L isin BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^-Omega ^(T(n) ^log ^T(n)) fraction of inputs of length n.

求助全文

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

来源期刊

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)

自引率

0.00%

发文量