Sökning: "Time-Complexity"
Visar resultat 1 - 5 av 40 avhandlingar innehållade ordet Time-Complexity.
1. Functional Program Correctness Through Types
Sammanfattning : This thesis addresses the problem of avoiding errors in functionalprograms. The thesis has three parts, discussing different aspects ofprogram correctness, with the unifying theme that types are anintegral part of the methods used to establish correctness. LÄS MER
2. Resource-Predictable and Efficient Monitoring of Events
Sammanfattning : We present a formally specified event specification language (Solicitor). Solicitor is suitable for real-time systems, since it results in resource-predictable and efficient event monitors. LÄS MER
3. Open Quantum Systems : Effects in Interferometry, Quantum Computation, and Adiabatic Evolution
Sammanfattning : The effects of open system evolution on single particle interferometry, quantum computation, and the adiabatic approximation are investigated.Single particle interferometry: Three concepts concerning completely positive maps (CPMs) and trace preserving CPMs (channels), named subspace preserving (SP) CPMs, subspace local channels, and gluing of CPMs, are introduced. LÄS MER
4. New Results on Combinatorial Algorithms
Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER
5. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Sammanfattning : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. LÄS MER