Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491): Difference between revisions

@@ label / en / label / en @@
+Lower Bounds for DeMorgan Circuits of Bounded Negation Width
@@ Property / DOI @@
-.4230/LIPIcs.STACS.2019.41
@@ Property / DOI: 10.4230/LIPIcs.STACS.2019.41 / rank @@
-Normal rank
@@ Property / author @@
-Stasys P. Jukna
@@ Property / author: Stasys P. Jukna / rank @@
-Normal rank
@@ Property / author @@
-Andrzej Lingas
@@ Property / author: Andrzej Lingas / rank @@
-Normal rank
@@ Property / author @@
+Stasys P. Jukna
@@ Property / author: Stasys P. Jukna / rank @@
+Normal rank
@@ Property / author @@
+Andrzej Lingas
@@ Property / author: Andrzej Lingas / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+The Potential of the Approximation Method
@@ Property / cites work: The Potential of the Approximation Method / rank @@
+Normal rank
@@ Property / cites work @@
+Learning circuits with few negations
@@ Property / cites work: Learning circuits with few negations / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Negations in Cryptography
@@ Property / cites work: The Power of Negations in Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Higher lower bounds on monotone size
@@ Property / cites work: Higher lower bounds on monotone size / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Combinatorics of monotone computations
@@ Property / cites work: Combinatorics of monotone computations / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Q3905209
@@ Property / cites work: Q3905209 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient monotone circuits for threshold functions
+Normal rank
@@ Property / cites work @@
+Depth Lower Bounds against Circuits with Sparse Orientation*
+Normal rank
@@ Property / cites work @@
+Q5121914
@@ Property / cites work: Q5121914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3966063
@@ Property / cites work: Q3966063 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly exponential lower bounds for monotone computation
+Normal rank
@@ Property / cites work @@
+Bounds on Monotone Switching Networks for Directed Connectivity
+Normal rank
@@ Property / cites work @@
+Monotone circuits for matching require linear depth
+Normal rank
@@ Property / cites work @@
+Q3758729
@@ Property / cites work: Q3758729 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on monotone complexity of the logical permanent
+Normal rank
@@ Property / cites work @@
+Applications of matrix methods to the theory of lower bounds in computational complexity
+Normal rank
@@ Property / cites work @@
+Q4601839
@@ Property / cites work: Q4601839 / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+The gap between monotone and non-monotone circuit complexity is exponential
+Normal rank
@@ Property / cites work @@
+Relating monotone formula size and monotone depth of Boolean functions
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/lipics.stacs.2019.41
+Normal rank
@@ Property / OpenAlex ID @@
+W2934762734
@@ Property / OpenAlex ID: W2934762734 / rank @@
+Normal rank
@@ Property / title @@
+Lower Bounds for DeMorgan Circuits of Bounded Negation Width (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.STACS.2019.41
@@ Property / DOI: 10.4230/LIPICS.STACS.2019.41 / rank @@
+Normal rank