Query Complexity in Errorless Hardness Amplification (Q3088136): Difference between revisions

@@ 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/978-3-642-22935-0_58
+Normal rank
@@ Property / OpenAlex ID @@
+W2270257564
@@ Property / OpenAlex ID: W2270257564 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
+Normal rank
@@ Property / cites work @@
+On Yao’s XOR-Lemma
@@ Property / cites work: On Yao’s XOR-Lemma / 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 @@
+Q4252738
@@ Property / cites work: Q4252738 / 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 @@
+Average Case Complete Problems
@@ Property / cites work: Average Case Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness amplification within NP
@@ Property / cites work: Hardness amplification within NP / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness Amplification Proofs Require Majority
@@ Property / cites work: Hardness Amplification Proofs Require Majority / rank @@
+Normal rank