Complexity of Hard-Core Set Proofs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
171 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
145 | en_US |
dc.citation.volume |
20 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Lu, Chi-Jen | en_US |
dc.contributor.author |
Tsai, Shi-Chun | en_US |
dc.contributor.author |
Wu, Hsin-Lung | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:11:57Z | |
dc.date.available |
2014-12-08T15:11:57Z | |
dc.date.issued |
2011-03-01 | en_US |
dc.description.abstract |
We study a fundamental result of Impagliazzo (FOCS'95) known as the hard-core set lemma. Consider any function f : {0,1}(n) -> {0,1} which is "mildly hard", in the sense that any circuit of size s must disagree with f on at least a delta fraction of inputs. Then, the hard-core set lemma says that f must have a hard-core set H of density delta on which it is "extremely hard", in the sense that any circuit of size s' = O(s/1/epsilon(2) log 1/epsilon(delta)))) must disagree wiht f on at least (1 - epsilon)/2 fraction of inputs from H. There are three issues of the lemma which we would like to address: the loss of circuit size, the need of non-uniformity, and its inapplicability to a low-level complexity class. We introduce two models of hard-core set proofs, a strongly black-box one and a weakly black-box one, and show that those issues are unavoidable in such models. First, we show that using any strongly black-box proof, one can only prove the hardness of a hard-core set for smaller circuits of size at most s' = O(s/1/epsilon(2) log 1/delta)). Next, we show that any weakly black-box proof must be inherently non-uniform-to have a hard-core set for a class G of functions, we need to start from the assumption that f is hard against a non-uniform complexity class with Omega(1/epsilon log vertical bar G vertical bar) bits of advice. Finally, we show that weakly black-box proofs in general cannot be realized in a low-level complexity class such as AC (0)[p]-the assumption that f is hard for AC (0)[p] is not sufficient to guarantee the existence of a hard-core set. | en_US |
dc.identifier.doi |
10.1007/s00037-011-0003-7 | en_US |
dc.identifier.issn |
1016-3328 | en_US |
dc.identifier.journal |
COMPUTATIONAL COMPLEXITY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s00037-011-0003-7 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/9165 | |
dc.identifier.wosnumber |
WOS:000290276600005 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Hard-core set | en_US |
dc.subject |
hardness amplification | en_US |
dc.subject |
black-box proofs | en_US |
dc.title |
Complexity of Hard-Core Set Proofs | en_US |
dc.type |
Article | en_US |
檔案
- 000290276600005.pdf (356.0 KB, Adobe PDF)
所屬典藏: 期刊論文