Search for dissertations about: "Peter Jonsson"
Showing result 16 - 20 of 28 swedish dissertations containing the words Peter Jonsson.
-
16. A Resource for Quantum Computation
Abstract : In this thesis we address the question, what is the resource, or property, that enables the advantage of quantum computers? The theory of quantum computers dates back to the eighties, so one would think there already is an answer to this question. There are several proposed solutions, but to this date, there is no consensus on an answer. READ MORE
-
17. On the Power of Quantum Computation: Oracles
Abstract : Quantum computation solve some computational problems faster than the best-known alternative in classical computation. The evidence for this consists of examples where a quantum algorithm outperforms the best-known classical algorithm. READ MORE
-
18. Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
Abstract : In this thesis we study the worst-case time complexity of the constraint satisfaction problem parameterized by a constraint language (CSP(S)), which is the problem of determining whether a conjunctive formula over S has a model. To study the complexity of CSP(S) we borrow methods from universal algebra. READ MORE
-
19. Stability of UO2 in systems containing radiolytic oxidants : The role of uranyl peroxide species
Abstract : Nuclear power constitutes a major pillar on the global energy market, and it will most probably increase in importance as fossil fuels are gradually phased out. The main problem connected to nuclear power is the generation of highly radiotoxic spent nuclear fuel (95% UO2 and 5% radioactive fission products and heavier actinides). READ MORE
-
20. Complexity Dichotomies for CSP-related Problems
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