Near optimal seperation of tree-like and general resolution (Q558312): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+F20
@@ Property / Mathematics Subject Classification ID: 03F20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 03B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+2186409
@@ Property / zbMATH DE Number: 2186409 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+near optimal seperation
@@ Property / zbMATH Keywords: near optimal seperation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+automated theorem proving
@@ Property / zbMATH Keywords: automated theorem proving / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tree-like resolution refutations
@@ Property / zbMATH Keywords: tree-like resolution refutations / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+general resolution refutations
@@ Property / zbMATH Keywords: general resolution refutations / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial run-time
@@ Property / zbMATH Keywords: polynomial run-time / 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.1007/s00493-004-0036-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2092984557
@@ Property / OpenAlex ID: W2092984557 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:558312