Existentially Restricted Quantified Constraint Satisfaction

Details Existentially Restricted Quantified Constraint Satisfaction Existentially Restricted Quantified Constraint Satisfaction

2005-06-14

arxiv.org/abs/cs/0506059v1

Computer Science

Computational Complexity

Scientific paper

The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In this paper, we introduce and study a new model for investigating QCSP complexity in which the types of constraints given by the existentially quantified variables, is restricted. Our primary technical contribution is the development and application of a general technology for proving positive results on parameterizations of the model, of inclusion in the complexity class coNP.

Affiliated with

Also associated with

No associations

Rating

Existentially Restricted Quantified Constraint Satisfaction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Existentially Restricted Quantified Constraint Satisfaction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Existentially Restricted Quantified Constraint Satisfaction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224884