On the hardness of solving edge matching puzzles as SAT or CSP problems

ISSN： 1383-7133

Source： Constraints, Vol.18, Iss.1, 2013-01, pp. : 7-37

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Comparison between SAT and CSP Techniques

By Bennaceur Hachemi

Constraints, Vol. 9, Iss. 2, 2004-04 ,pp. : 123-138

Springer Publishing Company

Access to resources Recommend Favorite

A Mixed Closure-CSP Method for Solving Scheduling Problems: Special Issue: Engineering Intelligent Systems (Guest Editor: László Monostori)

By Alfonso María Isabel Barber Federico

Applied Intelligence, Vol. 21, Iss. 2, 2004-09 ,pp. : 173-193

Springer Publishing Company

Access to resources Recommend Favorite

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

By Guruswami V. Khanna S. Rajaraman R. Shepherd B. Yannakakis M.

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 473-496

Elsevier

Access to resources Recommend Favorite

Random 2-SAT: results and problems

By Fernandez de la Vega W.

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 131-146

Elsevier

Access to resources Recommend Favorite

SAT-Solving the Coverability Problem for Petri Nets

By Abdulla Parosh Aziz Iyer S. Purushothaman Nylén Aletta

Formal Methods in System Design, Vol. 24, Iss. 1, 2004-01 ,pp. : 25-43

Springer Publishing Company

Access to resources Recommend Favorite