The following pages link to (Q4250183):
Displaying 37 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- A new approach for weighted constraint satisfaction (Q698082) (← links)
- Approximating satisfiable satisfiability problems (extended abstract) (Q826119) (← links)
- Inapproximability results for equations over infinite groups (Q974745) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- Approximating satisfiable satisfiability problems (Q1578395) (← links)
- On bounded occurrence constraint satisfaction (Q1607037) (← links)
- MAX3SAT is exponentially hard to approximate if NP has positive dimension. (Q1853564) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Elliptic approximations of propositional formulae (Q1961455) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
- The approximability of constraint satisfaction problems (Q2706139) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Universal Factor Graphs (Q2843260) (← links)
- Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set (Q2913811) (← links)
- Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra (Q2957877) (← links)
- A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290) (← links)
- A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965) (← links)
- (Q5091725) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
- The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom (Q5326612) (← links)
- The Approximability of Three-valued MAX CSP (Q5470737) (← links)
- (Q5743431) (← links)
- Best possible approximation algorithm for MAX SAT with cardinality constraint. (Q5945919) (← links)
- Linear-consistency testing. (Q5946056) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
