Q5874535 (Q5874535): Difference between revisions

@@ Property / cites work @@
+Q5875790
@@ Property / cites work: Q5875790 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+Representing Boolean functions as polynomials modulo composite numbers
+Normal rank
@@ Property / cites work @@
+A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
+Normal rank
@@ Property / cites work @@
+Complexity of Counting CSP with Complex Weights
@@ Property / cites work: Complexity of Counting CSP with Complex Weights / rank @@
+Normal rank
@@ Property / cites work @@
+Best-case and worst-case sparsifiability of Boolean CSPs
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for maximum generalized satisfiability problems.
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Towards a characterization of constant-factor approximable finite-valued CSPs
+Normal rank
@@ Property / cites work @@
+The approximability of MAX CSP with fixed-value constraints
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4993600
@@ Property / cites work: Q4993600 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsification upper and lower bounds for graph problems and not-all-equal SAT
+Normal rank
@@ Property / cites work @@
+Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
+Normal rank
@@ Property / cites work @@
+Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
+Normal rank
@@ Property / cites work @@
+The Approximability of Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
+Normal rank
@@ Property / cites work @@
+Preprocessing of Min Ones Problems: A Dichotomy
@@ Property / cites work: Preprocessing of Min Ones Problems: A Dichotomy / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607968
@@ Property / cites work: Q4607968 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for CSPs
@@ Property / cites work: Approximation Algorithms for CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595902
@@ Property / cites work: Q5595902 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
+Normal rank
@@ Property / cites work @@
+A lower bound on the MOD 6 degree of the OR function
+Normal rank
@@ Property / cites work @@
+Polynomials with two values
@@ Property / cites work: Polynomials with two values / rank @@
+Normal rank
@@ Property / cites work @@
+Some consequences of non-uniform conditions on uniform classes
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5874535