scientific article; zbMATH DE number 2086240

MaRDI QIDQ3044338zbMATH OpenFDO

Authors Jianer Chen, Iyad Kanj

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860341.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Improved exact algorithms for MAX-SAT
• Exact algorithms for MAX-SAT
• New Upper Bounds for Maximum Satisfiability
• scientific article; zbMATH DE number 1522934
• Improved exact algorithms for mildly sparse instances of MAX SAT

Cited in

(24)

• Resolution for Max-SAT
• An algorithm for exact satisfiability analysed with the number of clauses as parameter
• Improved exact algorithms for MAX-SAT
• A new upper bound for \(( n , 3)\)-MAX-SAT
• A refined branching algorithm for the maximum satisfiability problem
• Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment
• A logical approach to efficient Max-SAT solving
• Improved exact algorithms for mildly sparse instances of MAX SAT
• A new algorithm for optimal 2-constraint satisfaction and its implications
• scientific article; zbMATH DE number 1629855 (Why is no real title available?)
• Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
• Improvements to Hybrid Incremental SAT Algorithms
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• scientific article; zbMATH DE number 1522934 (Why is no real title available?)
• A new algorithm for parameterized MAX-SAT
• Exact algorithms for MAX-SAT
• scientific article; zbMATH DE number 1405665 (Why is no real title available?)
• Dealing with 4-variables by resolution: an improved MaxSAT algorithm
• Improved exact algorithms for mildly sparse instances of MAX SAT
• Theory and Applications of Satisfiability Testing
• A Complete Calculus for Max-SAT
• Algorithms and Computation
• Solving MAX-\(r\)-SAT above a tight lower bound
• On the parallel parameterized complexity of MaxSAT variants

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 Q3044338)