On hardness of one-way functions (Q1097693): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(88)90071-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1985764593
@@ Property / OpenAlex ID: W1985764593 / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+A note on the complexity of cryptography (Corresp.)
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4162663
@@ Property / cites work: Q4162663 / rank @@
+Normal rank
@@ Property / cites work @@
+On some natural complete operators
@@ Property / cites work: On some natural complete operators / 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 @@
+A low and a high hierarchy within NP
@@ Property / cites work: A low and a high hierarchy within NP / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758245
@@ Property / cites work: Q3758245 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank