Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2019.03.008
@@ Property / DOI: 10.1016/j.ic.2019.03.008 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2019.03.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2926972612
@@ Property / OpenAlex ID: W2926972612 / 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 @@
+First-order definability on finite structures
@@ Property / cites work: First-order definability on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705344
@@ Property / cites work: Q4705344 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5363777
@@ Property / cites work: Q5363777 / rank @@
+Normal rank
@@ Property / cites work @@
+On uniformity within \(NC^ 1\)
@@ Property / cites work: On uniformity within \(NC^ 1\) / rank @@
+Normal rank
@@ Property / cites work @@
+Linear FPT reductions and computational lower bounds
+Normal rank
@@ Property / cites work @@
+From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
+Normal rank
@@ Property / cites work @@
+A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
+Normal rank
@@ Property / cites work @@
+On the space and circuit complexity of parameterized problems: classes and completeness
+Normal rank
@@ Property / cites work @@
+Describing parameterized complexity classes
@@ Property / cites work: Describing parameterized complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding First-Order Properties of Nowhere Dense Graphs
+Normal rank
@@ Property / cites work @@
+Large Cliques Elude the Metropolis Process
@@ Property / cites work: Large Cliques Elude the Metropolis Process / rank @@
+Normal rank
@@ Property / cites work @@
+Expected complexity of graph partitioning problems
+Normal rank
@@ Property / cites work @@
+Q4728251
@@ Property / cites work: Q4728251 / rank @@
+Normal rank
@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302097
@@ Property / cites work: Q5302097 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q128143341
@@ Property / Wikidata QID: Q128143341 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2019.03.008
@@ Property / DOI: 10.1016/J.IC.2019.03.008 / rank @@
+Normal rank