Search for dissertations about: "FUNDAMENTAL THEOREM"

Showing result 16 - 20 of 33 swedish dissertations containing the words FUNDAMENTAL THEOREM.

  2. 16. Zeros and growth of entire functions of several variables, the complex Monge-Ampère operator and some related topics

    Author : Yang Xing; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; matematik; Mathematics;

    Abstract : The classical Levin-Pfluger theory of entire functions of completely regular growth (CRG) of finite order p in one variable establishes a relation between the distribution of zeros of an entire function and its growth. The most important and interesting result in this theory is the fundamental principle for CRG functions. READ MORE

  4. 17. Applications of Gaussian Noise Stability in Inapproximability and Social Choice Theory

    Author : Marcus Isaksson; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Gaussian noise stability; inapproximability theory; invariance principle; max-q-cut; condorcet voting; max-q-cut;

    Abstract : Gaussian isoperimetric results have recently played an important role in proving fundamental results in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we prove a generalization of a Gaussian isoperimetric result by Borell and show that it implies that the majority function is optimal in Condorcet voting in the sense that it maximizes the probability that there is a single candidate which the society prefers over all other candidates. READ MORE

  5. 18. New techniques for handling quantifiers in Boolean and first-order logic

    Author : Peter Backeman; Philipp Rümmer; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Abstract : The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all four basic arithmetic operators. READ MORE

  6. 19. Complexity Dichotomies for CSP-related Problems

    Author : Gustav Nordh; Peter Jonsson; Andrei Krokhin; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Complexity; Constraint Satisfaction Problem; System of Equations; Nonmonotonic Logic; Circumscription; Abduction; Isomorphism; Computer science; Datavetenskap;

    Abstract : 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. READ MORE

  7. 20. Bell tests and the no-signalling assumption

    Author : Massimiliano Smania; Mohamed Bourennane; Ingemar Bengtsson; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; quantum; quantum optics; Bell tests; CHSH inequality; entanglement; fysik; Physics;

    Abstract : Bell's theorem was originally meant for testing fundamental properties of Nature, namely local realism. However, through the years it has become a powerful device for certifying encryption security, randomness, and entanglement among other properties. READ MORE