Sökning: "Hardness"

Visar resultat 21 - 25 av 426 avhandlingar innehållade ordet Hardness.

  1. 21. Hårdare kulytor: tekniska och mekaniska förfaranden

    Författare :Per Öhl; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; coldworking; hardening; bearing ball; surface; contact theories; hardness; residual stresses;

    Sammanfattning : .... LÄS MER

  3. 22. Topics in Hardness of Approximation and Social Choice Theory

    Författare :Marcus Isaksson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Hardness of approximation; social choice theory; Gibbard-Satterthwaite; max-q-cut; Condorcet voting; linear threshold functions.; Hardness of approximation;

    Sammanfattning : Tools from Fourier analysis of Boolean functions have commonly been used to prove results both in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we consider various topics in both these contexts. LÄS MER

  4. 23. Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions

    Författare :Aleksa Stankovic; Johan Håstad; Per Austrin; Luca Trevisan; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Hardness of Approximation; Approximation Algorithms; Label Cover; Vertex Cover; Unique Games Conjecture; Max-3-Lin; Universal Factor Graphs; Regular Constraint Satisfaction Problems; Inapproximerbarhet; Approximationsalgoritm; Label Cover; Vertex Cover; Unique Games Conjecture; Max-3-Lin; Universell Faktorgraf; Regelbundna Begränsningsproblem; Datalogi; Computer Science;

    Sammanfattning : This thesis studies how the approximability of some fundamental computational problems is affected by some additional requirements on the structure of the inputs. The problems studied in this thesis belong or are closely related to constraint satisfaction problems (CSPs), which are considered to be one of the most fundamental problems in theoretical computer science. LÄS MER

  5. 24. Algorithms and Hardness Results for Some Valued CSPs

    Författare :Fredrik Kuivinen; Peter Jonsson; Peter Jeavons; Linköpings universitet; []
    Nyckelord :TECHNOLOGY; TEKNIKVETENSKAP;

    Sammanfattning : In the Constraint Satisfaction Problem (CSP) one is supposed to find an assignment to a set of variables so that a set of given constraints are satisfied. Many problems, both practical and theoretical, can be modelled as CSPs. LÄS MER

  7. 25. On probabilistic proof systems and hardness of approximation

    Författare :Jonas Holmerin; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical analysis; Matematisk analys;

    Sammanfattning : .... LÄS MER