In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. We describe a novel connection between this problem and the supermodular function maximization problem (which is dual to the submodular function minimization problem). Using this connection, we are able to identify large classes of efficiently solvable subproblems of M...

The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in the VCSP framework. Using our analysis, we show that some optimisation problems, such as (s, t)-Min-Cut and Submodular Function Minimisation, can be modelled using a restricted set of valued constraints which are tra...

introduction infertility as the bitterest life experience can affect sexual function. infertility is a reproductive health problem and many studies have showed agitation, stress, depression, marital and sexual dissatisfaction as the psychological outcomes of infertility. this study aimed to compare sexual satisfaction in fertile and infertile women referring to peymanieh hospital in jahrom, 201...

Analog circuits are often specified using non-linear equations, which are difficult to analyze. Therefore, test generation and diagnosis are problematic issues in practice. In this paper we propose a new method for diagnosis of analog circuits that uses combined information from tests at different frequencies. By solving simultaneously the resulting equations (one for each test frequency), we g...

This research presents the design, usage, and evaluation of a highly generic music constraint system called Strasheela. Strasheela simplifies the definition of musical constraint satisfaction problems (CSP) by predefining building blocks required for such problems. At the same time, Strasheela preserves a high degree of generality and is reasonably efficient. Strasheela is highly generic, becau...

We give a complexity theoretic classification of the counting versions of so-called H-colouring problems for graphs H that may have multiple edges between the same pair of vertices. More generally, we study the problem of computing a weighted sum of homomorphisms to a weighted graph H. The problem has two interesting alternative formulations: First, it is equivalent to computing the partition f...

INTRODUCTION Provoked vestibulodynia (PVD) is a women's genito-pelvic pain condition associated with psychosexual impairments, including depression. Body image (BI) has been found to be different in women with primary (PVD1) and secondary (PVD2) PVD. No controlled study has compared BI in women with PVD1 and PVD2 and investigated its associations with sexual satisfaction, sexual function, and p...

We close a gap in the proof of Theorem 4.1 in our paper “The complexity of counting graph homomorphisms” [Random Structures and Algorithms 17 (2000), 260– 289]. Our paper [2] analysed the complexity of counting graph homomorphisms from a given graph G into a fixed graph H. This problem was called #H. A crucial step in our argument, Theorem 4.1, was to prove that the counting problem #H is #P -c...

In this paper we study the complexity of the (weighted) maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. In this problem, one is given a collection of weighted constraints on overlapping sets of variables, and the goal is to find an assignment of values to the variables so as to maximize the total weight of satisfied constraints. Max Cut is a typical example of...