Pages that link to "Item:Q4500858"
From MaRDI portal
The following pages link to New Upper Bounds for Maximum Satisfiability (Q4500858):
Displaying 46 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems (Q1288467) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- New worst-case upper bounds for SAT (Q1581847) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
- A new upper bound for \(( n , 3)\)-MAX-SAT (Q1946835) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Computational protein design as an optimization problem (Q2453727) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- New worst-case upper bounds for SAT (Q2749858) (← links)
- New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- New Bounds for MAX-SAT by Clause Learning (Q3499776) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
