Sums of Read-Once Formulas: How Many Summands Suffice? (Q5740191): Difference between revisions

@@ Property / cites work @@
+Deterministic polynomial identity tests for multilinear bounded-read formulae
+Normal rank
@@ Property / cites work @@
+On interpolating arithmetic read-once formulas with exponentiation
+Normal rank
@@ Property / cites work @@
+Interpolating Arithmetic Read-Once Formulas in Parallel
+Normal rank
@@ Property / cites work @@
+Learning Boolean read-once formulas over generalized bases
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Sums of Powers of Low Degree Univariates
+Normal rank
@@ Property / cites work @@
+Multi-linear formulas for permanent and determinant are of super-polynomial size
+Normal rank
@@ Property / cites work @@
+Q5497117
@@ Property / cites work: Q5497117 / rank @@
+Normal rank
@@ Property / cites work @@
+Read-once polynomial identity testing
@@ Property / cites work: Read-once polynomial identity testing / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing Arithmetic Read-Once Formulae
@@ Property / cites work: Characterizing Arithmetic Read-Once Formulae / rank @@
+Normal rank