Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535): Difference between revisions

@@ Property / author @@
-Piotr J. Wojciechowski
@@ Property / author: Piotr J. Wojciechowski / rank @@
-Normal rank
@@ Property / author @@
-Q261361
@@ Property / author: Q261361 / rank @@
-Normal rank
@@ Property / author @@
+Piotr J. Wojciechowski
@@ Property / author: Piotr J. Wojciechowski / rank @@
+Normal rank
@@ Property / author @@
+K. Subramani and Vahan Mkrtchyan
@@ Property / author: K. Subramani and Vahan Mkrtchyan / 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.tcs.2018.02.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2789909559
@@ Property / OpenAlex ID: W2789909559 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Q4399249
@@ Property / cites work: Q4399249 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounded random access machines
@@ Property / cites work: Time bounded random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of read-once resolution
@@ Property / cites work: The complexity of read-once resolution / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of some classes of minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets resolved
@@ Property / cites work: The complexity of facets resolved / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank
@@ Property / cites work @@
+Q3618853
@@ Property / cites work: Q3618853 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal length tree-like resolution refutations for 2SAT formulas
+Normal rank
@@ Property / cites work @@
+Q4539605
@@ Property / cites work: Q4539605 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Propositional                                                   Proofs
@@ Property / cites work: The Complexity of Propositional Proofs / rank @@
+Normal rank