Hardness of sparse sets and minimal circuit size problem (Q2019493): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3082776702
@@ Property / OpenAlex ID: W3082776702 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111269
@@ Property / cites work: Q5111269 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum oracle circuit size problem
@@ Property / cites work: The minimum oracle circuit size problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5121893
@@ Property / cites work: Q5121893 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111137
@@ Property / cites work: Q5111137 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5368752
@@ Property / cites work: Q5368752 / rank @@
+Normal rank
@@ Property / cites work @@
+On the NP-Completeness of the Minimum Circuit Size Problem.
+Normal rank
@@ Property / cites work @@
+Weak lower bounds on resource-bounded compression imply strong separations of complexity classes
+Normal rank
@@ Property / cites work @@
+Q5368903
@@ Property / cites work: Q5368903 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness magnification near state-of-the-art lower bounds
+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