Complexity of hard-core set proofs
type: Item
instance of: scholarly article
title: Complexity of hard-core set proofs
zbMATH Open document ID: 1255.68067
author: Chi-Jen Lu
author: Shi-Chun Tsai
author: Hsin-Lung Wu
published in: Computational Complexity
publication date: 2012-09-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6085139
zbMATH Keywords: hard-core set
zbMATH Keywords: hardness amplification
zbMATH Keywords: black-box proofs
MaRDI profile type: Publication
full work available at URL: s00037-011-0003-7
OpenAlex ID: W2084411549
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
cites work: Boosting a weak learning algorithm by majority
cites work: Majority gates vs. general weighted threshold gates
cites work: Threshold circuits of bounded depth
cites work: Using Nondeterminism to Amplify Hardness
cites work: Key agreement from weak bit agreement
cites work: Q4252738
cites work: Q4526985
cites work: Boosting and hard-core set construction
cites work: On the Complexity of Hard-Core Set Constructions
cites work: On the Complexity of Hardness Amplification
cites work: Hardness amplification within NP
cites work: Q5302083
cites work: Pseudorandom generators without the XOR lemma
cites work: On uniform amplification of hardness in NP
DOI: 10.1007/S00037-011-0003-7
description: scientific article; zbMATH DE number 6085139