The power of adaptiveness and additional queries in random-self- reductions (Q1332664): Difference between revisions

@@ Property / cites work @@
+On hiding information from an oracle
@@ Property / cites work: On hiding information from an oracle / rank @@
+Normal rank
@@ Property / cites work @@
+Random oracles separate PSPACE from the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+Q4279564
@@ Property / cites work: Q4279564 / rank @@
+Normal rank
@@ Property / cites work @@
+Designing programs that check their work
@@ Property / cites work: Designing programs that check their work / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Q4287358
@@ Property / cites work: Q4287358 / rank @@
+Normal rank
@@ Property / cites work @@
+Random-Self-Reducibility of Complete Sets
@@ Property / cites work: Random-Self-Reducibility of Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+The power of adaptiveness and additional queries in random-self- reductions
+Normal rank
@@ Property / cites work @@
+Probabilistic encryption
@@ Property / cites work: Probabilistic encryption / rank @@
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+IP = PSPACE
@@ Property / cites work: IP = PSPACE / rank @@
+Normal rank