Sökning: "satisfaction classes"
Visar resultat 1 - 5 av 18 avhandlingar innehållade orden satisfaction classes.
1. Satisfaction classes in nonstandard models of first-order arithmetic
Sammanfattning : .... LÄS MER
2. On Some Combinatorial Optimization Problems : Algorithms and Complexity
Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER
3. Complexity Dichotomies for CSP-related Problems
Sammanfattning : Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. LÄS MER
4. Group based antenatal care : expectations, attitudes and experiences from parents’ and midwives’ perspective
Sammanfattning : Group based antenatal care (GBAC) is a model of antenatal care that has been implemented in Sweden since year 2000. Sparse research has been conducted in Sweden but in the USA, where the model is more common, the research has found that women ́s satisfaction with GBAC is higher than with standard individual care (SC). LÄS MER
5. Private Health Insurance in Sweden : Implications for the legitimacy of the public health care system
Sammanfattning : The market for private health insurance (PHI) is growing in many countries with public, tax-funded health care systems. In Sweden, this development has generated an at times intense and polarised debate, exposing that the principles on which the public health care system rests in many aspects collide with the construction of PHI. LÄS MER