Complexity of hard-core set proofs (Q451110): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q05
@@ Property / Mathematics Subject Classification ID: 68Q05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q10
@@ Property / Mathematics Subject Classification ID: 68Q10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6085139
@@ Property / zbMATH DE Number: 6085139 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hard-core set
@@ Property / zbMATH Keywords: hard-core set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hardness amplification
@@ Property / zbMATH Keywords: hardness amplification / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+black-box proofs
@@ Property / zbMATH Keywords: black-box proofs / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00037-011-0003-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2084411549
@@ Property / OpenAlex ID: W2084411549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
+Normal rank
@@ Property / cites work @@
+Boosting a weak learning algorithm by majority
@@ Property / cites work: Boosting a weak learning algorithm by majority / rank @@
+Normal rank
@@ Property / cites work @@
+Majority gates vs. general weighted threshold gates
+Normal rank
@@ Property / cites work @@
+Threshold circuits of bounded depth
@@ Property / cites work: Threshold circuits of bounded depth / rank @@
+Normal rank
@@ Property / cites work @@
+Using Nondeterminism to Amplify Hardness
@@ Property / cites work: Using Nondeterminism to Amplify Hardness / rank @@
+Normal rank
@@ Property / cites work @@
+Key agreement from weak bit agreement
@@ Property / cites work: Key agreement from weak bit agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252738
@@ Property / cites work: Q4252738 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting and hard-core set construction
@@ Property / cites work: Boosting and hard-core set construction / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Hard-Core Set Constructions
@@ Property / cites work: On the Complexity of Hard-Core Set Constructions / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Hardness Amplification
@@ Property / cites work: On the Complexity of Hardness Amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness amplification within NP
@@ Property / cites work: Hardness amplification within NP / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302083
@@ Property / cites work: Q5302083 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators without the XOR lemma
@@ Property / cites work: Pseudorandom generators without the XOR lemma / rank @@
+Normal rank
@@ Property / cites work @@
+On uniform amplification of hardness in NP
@@ Property / cites work: On uniform amplification of hardness in NP / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:451110