On the shrinkage exponent for read-once formulae (Q1367534): Difference between revisions

@@ 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 @@
+Amplification and percolation (probabilistic Boolean functions)
+Normal rank
@@ Property / cites work @@
+How Do Read-Once Formulae Shrink?
@@ Property / cites work: How Do Read-Once Formulae Shrink? / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+The effect of random restrictions on formula size
@@ Property / cites work: The effect of random restrictions on formula size / rank @@
+Normal rank
@@ Property / cites work @@
+Shrinkage of de Morgan formulae under restriction
@@ Property / cites work: Shrinkage of de Morgan formulae under restriction / rank @@
+Normal rank
@@ Property / cites work @@
+Short monotone formulae for the majority function
@@ Property / cites work: Short monotone formulae for the majority function / rank @@
+Normal rank
@@ Property / cites work @@
+A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes
+Normal rank
@@ Property / cites work @@
+Q3281059
@@ Property / cites work: Q3281059 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
+Normal rank
@@ Property / cites work @@
+Method of determining lower bounds for the complexity of \(\Pi\)-circuits
+Normal rank