Uniform generation of NP-witnesses using an NP-oracle (Q1854397): Difference between revisions

@@ Property / cites work @@
+Statistical zero-knowledge languages can be recognized in two rounds
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+Simulating (log             <sup>c</sup>             <i>n</i>             )-wise independence in NC
+Normal rank
@@ Property / cites work @@
+On the complexity of interactive proofs with bounded communication
+Normal rank
@@ Property / cites work @@
+Computational complexity and knowledge complexity (extended abstract)
+Normal rank
@@ Property / cites work @@
+The Knowledge Complexity of Interactive Proof Systems
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+The probabilistic method yields deterministic parallel algorithms
+Normal rank
@@ Property / cites work @@
+Q3135094
@@ Property / cites work: Q3135094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140437
@@ Property / cites work: Q3140437 / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank