Some observations on the probabilistic algorithms and NP-hard problems (Q1163371): Difference between revisions

@@ Property / author @@
-Ker-I. Ko
@@ Property / author: Ker-I. Ko / rank @@
-Normal rank
@@ Property / author @@
+Ker-I. Ko
@@ Property / author: Ker-I. Ko / 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.1016/0020-0190(82)90139-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2011358434
@@ Property / OpenAlex ID: W2011358434 / rank @@
+Normal rank
@@ Property / cites work @@
+Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Riemann's hypothesis and tests for primality
@@ Property / cites work: Riemann's hypothesis and tests for primality / rank @@
+Normal rank
@@ Property / cites work @@
+Every Prime Has a Succinct Certificate
@@ Property / cites work: Every Prime Has a Succinct Certificate / rank @@
+Normal rank
@@ Property / cites work @@
+Q4164569
@@ Property / cites work: Q4164569 / rank @@
+Normal rank
@@ Property / cites work @@
+Relativized questions involving probabilistic algorithms
+Normal rank
@@ Property / cites work @@
+A Fast Monte-Carlo Test for Primality
@@ Property / cites work: A Fast Monte-Carlo Test for Primality / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1163371