On the hardness of approximating max-satisfy (Q1045886): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.08.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2044184640
@@ Property / OpenAlex ID: W2044184640 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomized graph products
@@ Property / cites work: Derandomized graph products / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+On the number of zero-patterns of a sequence of polynomials
+Normal rank
@@ Property / cites work @@
+Free Bits, PCPs, and Nonapproximability---Towards Tight Results
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+A PCP characterization of NP with optimal amortized query complexity
+Normal rank