A lower bound on the size of resolution proofs of the Ramsey theorem (Q436623): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F20
@@ Property / Mathematics Subject Classification ID: 03F20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6059718
@@ Property / zbMATH DE Number: 6059718 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Ramsey theorem
@@ Property / zbMATH Keywords: Ramsey theorem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+resolution proofs
@@ Property / zbMATH Keywords: resolution proofs / 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.ipl.2012.05.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1993227745
@@ Property / OpenAlex ID: W1993227745 / rank @@
+Normal rank
@@ Property / cites work @@
+On the weak pigeonhole principle
@@ Property / cites work: On the weak pigeonhole principle / rank @@
+Normal rank
@@ Property / cites work @@
+A note on propositional proof complexity of some Ramsey-type statements
+Normal rank
@@ Property / cites work @@
+Q4281694
@@ Property / cites work: Q4281694 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:436623