Separating OR, SUM, and XOR circuits (Q269494): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2016.01.001
@@ Property / DOI: 10.1016/j.jcss.2016.01.001 / rank @@
-Normal rank
@@ Property / author @@
-Magnus Gausdal Find
@@ Property / author: Magnus Gausdal Find / rank @@
-Normal rank
@@ Property / author @@
+Magnus Gausdal Find
@@ Property / author: Magnus Gausdal Find / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1650093283
@@ Property / OpenAlex ID: W1650093283 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q42264471
@@ Property / Wikidata QID: Q42264471 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0513
@@ Property / arXiv ID: 1304.0513 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Circuits over $\operatorname{GF}(2)$
@@ Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743488
@@ Property / cites work: Q5743488 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2743189
@@ Property / cites work: Q2743189 / rank @@
+Normal rank
@@ Property / cites work @@
+Cancellation-Free Circuits in Unbounded and Bounded Depth
+Normal rank
@@ Property / cites work @@
+Logic minimization techniques with applications to cryptology
+Normal rank
@@ Property / cites work @@
+The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
+Normal rank
@@ Property / cites work @@
+The Complexity of Satisfiability of Small Depth Circuits
+Normal rank
@@ Property / cites work @@
+Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115280
@@ Property / cites work: Q3115280 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Finding Efficient Circuits for Ensemble Computation
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Complexity of Linear Boolean Operators
@@ Property / cites work: Complexity of Linear Boolean Operators / rank @@
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Norm-graphs and bipartite Turán numbers
@@ Property / cites work: Norm-graphs and bipartite Turán numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236503
@@ Property / cites work: Q3236503 / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Boolean sums
@@ Property / cites work: Some remarks on Boolean sums / rank @@
+Normal rank
@@ Property / cites work @@
+Q5656695
@@ Property / cites work: Q5656695 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417690
@@ Property / cites work: Q5417690 / rank @@
+Normal rank
@@ Property / cites work @@
+On another Boolean matrix
@@ Property / cites work: On another Boolean matrix / rank @@
+Normal rank
@@ Property / cites work @@
+On the Evaluation of Powers and Monomials
@@ Property / cites work: On the Evaluation of Powers and Monomials / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2016.01.001
@@ Property / DOI: 10.1016/J.JCSS.2016.01.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:269494