New upper bounds for the problem of maximal satisfiability (Q3225865): Difference between revisions

@@ Property / describes a project that uses @@
+SATO
@@ Property / describes a project that uses: SATO / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
+Normal rank
@@ Property / cites work @@
+Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
+Normal rank
@@ Property / cites work @@
+New Bounds for MAX-SAT by Clause Learning
@@ Property / cites work: New Bounds for MAX-SAT by Clause Learning / rank @@
+Normal rank
@@ Property / cites work @@
+New methods for 3-SAT decision and worst-case analysis
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-programming design and analysis of fast algorithms for Max 2-CSP
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1515/dma.2009.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2022837198
@@ Property / OpenAlex ID: W2022837198 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3225865