Author： Gault Richard Jeavons Peter
Publisher： Springer Publishing Company
ISSN： 1383-7133
Source： Constraints, Vol.9, Iss.2, 2004-04, pp. : 139-160
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Structural tractability of enumerating CSP solutions
Constraints, Vol. 18, Iss. 1, 2013-01 ,pp. :
Access to resources
Recommend
Fixed-parameter tractability and completeness II: On completeness for W[1]
Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. :
Tractability of cut-free Gentzen type propositional calculus with permutation inference
By Arai N.H.
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :
Implementing Metcast in Scheme
LISP and Symbolic Computation, Vol. 18, Iss. 3-4, 2005-12 ,pp. :