Local restrictions from the Furst-Saxe-Sipser paper (Q519884): Difference between revisions

@@ Property / OpenAlex ID @@
+W2557257622
@@ Property / OpenAlex ID: W2557257622 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2906562
@@ Property / cites work: Q2906562 / rank @@
+Normal rank
@@ Property / cites work @@
+The isomorphism conjecture for constant depth reductions
+Normal rank
@@ Property / cites work @@
+Q3288996
@@ Property / cites work: Q3288996 / rank @@
+Normal rank
@@ Property / cites work @@
+Reductions in circuit complexity: An isomorphism theorem and a gap theorem
+Normal rank
@@ Property / cites work @@
+Reducing the complexity of reductions
@@ Property / cites work: Reducing the complexity of reductions / rank @@
+Normal rank
@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Q3753481
@@ Property / cites work: Q3753481 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Boolean Functions
@@ Property / cites work: Analysis of Boolean Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+On one-one polynomial time equivalence relations
@@ Property / cites work: On one-one polynomial time equivalence relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3281059
@@ Property / cites work: Q3281059 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant depth circuits, Fourier transform, and learnability
+Normal rank
@@ Property / cites work @@
+A satisfiability algorithm and average-case hardness for formulas over the full binary basis
+Normal rank