The Minimum Satisfiability Problem
From MaRDI portal
Recommendations
Cited in
(38)- scientific article; zbMATH DE number 1688380 (Why is no real title available?)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Robust optimization with belief functions
- The no-meet matroid
- A primal-dual approximation algorithm for \textsc{minsat}
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- A non-clausal tableau calculus for \textsc{MinSat}
- Optimizing with minimum satisfiability
- Subset-conjunctive rules for breast cancer diagnosis
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Quantum computation techniques for gauging reliability of interval and fuzzy data
- Average Performance of Heuristics for Satisfiability
- A simplified NP-complete MAXSAT problem
- On dependent randomized rounding algorithms
- Minimal sets on propositional formulae. Problems and reductions
- On the intractability landscape of digraph intersection representations
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Average performance of greedy heuristics for the integer knapsack problem.
- Risk-averse single machine scheduling: complexity and approximation
- On the Minimum Hitting Set of Bundles Problem
- On approximation algorithms for the minimum satisfiability problem
- On reoptimizing multi-class classifiers
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- The Minimum Oracle Circuit Size Problem.
- The computational complexity of the pooling problem
- On dependent randomized rounding algorithms
- Classes of linear programs solvable by coordinate-wise minimization
- Revisiting maximum satisfiability and related problems in data streams
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- On the minimum hitting set of bundles problem
- Revisiting maximum satisfiability and related problems in data streams
- On the minimum satisfiability problem
- Stabilizing network bargaining games by blocking players
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- Voting on multi-issue domains with conditionally lexicographic preferences
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- Computing the Ehrhart polynomial of a convex lattice polytope
This page was built for publication: The Minimum Satisfiability Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296521)
