scientific article; zbMATH DE number 1303558
From MaRDI portal
Publication:4250183
zbMATH Open0930.68142MaRDI QIDQ4250183FDOQ4250183
Authors: Uri Zwick 
Publication date: 9 February 2000
Title of this publication is not available (Why is that?)
Recommendations
- The approximability of constraint satisfaction problems
- On the efficient approximability of constraint satisfaction problems
- Simultaneous approximation of constraint satisfaction problems
- On approximate constraint satisfaction
- An approximation algorithm for MAX 3-SAT
- scientific article; zbMATH DE number 6381632
- Near-optimal algorithms for maximum constraint satisfaction problems
- scientific article; zbMATH DE number 1002206
- Approximation algorithms for the maximum satisfiability problem
Cited In (44)
- Approximating satisfiable satisfiability problems (extended abstract)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
- Approximate algorithms for generalized maximum utility problems
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Adding cardinality constraints to integer programs with applications to maximum satisfiability
- Title not available (Why is that?)
- Pseudo-Boolean optimization
- Inapproximability results for equations over infinite groups
- Best possible approximation algorithm for MAX SAT with cardinality constraint.
- The Approximability of Three-valued MAX CSP
- On the hardness of efficiently approximating maximal non-\(L\) submatrices.
- Title not available (Why is that?)
- Improved parameterized set splitting algorithms: A Probabilistic approach
- A new approach for weighted constraint satisfaction
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Linear-consistency testing.
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- Improved approximations for max set splitting and max NAE SAT
- Title not available (Why is that?)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- On the mysteries of MAX NAE-SAT
- Title not available (Why is that?)
- The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom
- Universal factor graphs
- Elliptic approximations of propositional formulae
- Building a small and informative phylogenetic supertree
- On bounded occurrence constraint satisfaction
- A combinatorial algorithm for MAX CSP
- Semidefinite programming and constraint programming
- MAX3SAT is exponentially hard to approximate if NP has positive dimension.
- Tensor decomposition and approximation schemes for constraint satisfaction problems
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Inapproximability results for equations over finite groups
- An improved dictatorship test with perfect completeness
- Title not available (Why is that?)
- Differential approximation for optimal satisfiability and related problems
- Supermodular functions and the complexity of MAX CSP
- Simultaneous approximation of constraint satisfaction problems
- Reoptimization of constraint satisfaction problems with approximation resistant predicates
- Optimization, randomized approximability, and Boolean constraint satisfaction problems
- Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra
- A toolbox for barriers on interactive oracle proofs
- The approximability of constraint satisfaction problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250183)
