AI helps you reading Science
AI generates interpretation videos
AI extracts and analyses the key points of the paper to generate videos automatically
Go Generating
AI Traceability
AI parses the academic lineage of this thesis
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Inf. Process. Lett., no. 2 (2003): 73-78
EI
Get fulltext within 24h
Keywords
Abstract
In this paper, we prove under a plausible complexity hypothesis that Reduced Error Pruning of branching programs is hard to approximate within log1-δ n, for every δ 0, where n is the number of description variables, a measure of the problem's complexity. The result holds under the assumption that NP problems do not admit deterministic, sl...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cn