Parameterized proof complexity (Q451111): Difference between revisions

@@ Property / author @@
+Stefan S. Dantchev
@@ Property / author: Stefan S. Dantchev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2112145019
@@ Property / OpenAlex ID: W2112145019 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218929
@@ Property / cites work: Q4218929 / rank @@
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Upper Bounds for Vertex Cover
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs as Games
@@ Property / cites work: Proofs as Games / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity gap for tree resolution
@@ Property / cites work: A complexity gap for tree resolution / rank @@
+Normal rank