Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"Complexity class"”.
-
NP-completeness notions under strong hypotheses
A variety of completeness notions for the complexity class NP are studied under strong hypotheses about the size of this class. These hypotheses are based on the concept of resource-bounded genericity developed by Ambos-Spies, Fleischhack and Huwig. It is shown that many natural completeness …
-
The complexity of continuous local search
The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD ∩ PLS that have resisted, in some cases for decades, attempts to put them in polynomial time. No complete problem was known for CLS, and in …
-
Control, gates, and error suppression with Hamiltonians in quantum computation
… of using Hamiltonian controls. We also study the complexity class QMA-complete. We first investigate a method (introduced by Jordan, Farhi, and Shor) for suppressing environmentally induced errors in Hamiltonian-based quantum computation, involving encoding the system with a quantum …
-
Strategiesynthese für Paritätsspiele auf endlichen Graphen
… of a winning strategy) belongs to the complexity class NP intersection co-NP. It is one of the core problems in the theory of program verification, because many model checking problems can be reduced to solving parity games by a polynomial time reduction. In this thesis a new algorithm …
-
Quantum computation beyond the circuit model
… polynomials is complete for the one clean qubit complexity class, and a generalization of perturbative gadgets which allows k-body interactions to be directly simulated using 2-body interactions. Lastly, I discuss general principles regarding quantum computation that I learned in the course of my …
-
Delegating computation reliably : paradigms and constructions
… on foundational questions in cryptography and complexity theory. The focus of this thesis is verifying the correctness of delegated computations. We construct efficient protocols (interactive proofs) for delegating computational tasks. In particular, we present: e A protocol for delegating any …
-
Robust optimization
… both theoretically and practically than the classical robust framework. We cover a broad range of mathematical optimization problems, including linear optimization (LP), quadratic constrained quadratic optimization (QCQP), general conic optimization including second order cone programming …
-
Gadgets and Gizmos: A Formal Model of Simulation in the Gadget Framework for Motion Planning
… decision problems, so this has consequences for complexity. We define several classes of gizmos, and prove that they are closed under simulation: gizmos with some property cannot simulate gizmos without it. For several of these classes, we also find a gizmo which can simulate every gizmo in the …
-
DevelopinThe Bayesian Description Logic BALC
… Description Logics and applies it to the classical Description Logic ALC. We define five reasoning problems for BALC; two versions of concept satisfiability (called total and partial respectively), knowledge base consistency, three subsumption problems (positive subsumption, p-subsumption, …
-
Studies in Models of Quantum Proof Systems
… simplest quantum proof system is captured by the complexity class QMA. Interestingly, it is not known whether QMA retains its expressive power if we force it to have perfect completeness. Currently, the strongest result towards settling this question is by Kobayashi, Le Gall, and Nishimura. They …
-
Quantum proof systems and entanglement theory
Quantum complexity theory is important from the point of view of not only theory of computation but also quantum information theory. In particular, quantum multi-prover interactive proof systems are defined based on complexity theory notions, while their characterization can be formulated using …
-
Transitive Closure Logic and Multihead Automata with Nested Pebbles
… of first-order logic are studied in descriptive complexity theory. These extensions include transitive closure logic and deterministic transitive closure logic, which extend first-order logic with transitive closure operators. It is known that deterministic transitive closure logic captures the …
-
Graphical structure of unsatisfiable boolean formulae
… graph theory, this new variant builds upon the classical logic and computer science problem of boolean satisfiability k-SAT. k-SAT asks if there exists a truth assignment that satisfies a given boolean formula. Our variant deals with multi-hypergraphs instead of boolean formulae and uses truth …
-
Alternative models for quantum computation/
… that give quantum computers an advantage over classical ones. The bomb query complexity model is a variation on the query complexity model, inspired by the Elitzur-Vaidman bomb tester. In this model after each query to the black box the result is measured, and the algorithm fails if the …
-
Cryptographic tools for the cloud
Classical cryptography is playing a major role in securing the Internet. Banking transactions, medical records, personal and military messages are transmitted securely through the Internet using classical encryption and signature algorithms designed and developed over the last decades. However, …
-
The space around BQP
… devices from the perspective of computational complexity theory. Quantum computers hold the promise of solving many problems exponentially faster than classical computers. The computational power of universal quantum devices is captured by the complexity class BQP, which stands for …
-
A Hybrid Tabu/Scatter Search Algorithm for Simulation-Based Optimization of Multi-Objective Runway Operations Scheduling
… models for this problem belong to the complexity class of NP-Hard in a strong sense due to combinatorial nature of the problem. Therefore, it is only possible to solve practical runway operations scheduling problem by making a large number of simplifications and assumptions in a …
-
Parameterized Relaxations for Circuits and Graphs
… and others easy? In situations where complexitytheoretic hypotheses rule out the possibility of fast algorithms for problems, are there nonetheless instances for which we can evade intractability and still design efficient algorithms? In this thesis, we investigate these questions from …
-
Νέα μοντέλα για πρωτόκολλα πληθυσμών
Τα Ασύρματα Δίκτυα Αισθητήρων (ΑΔΑ) αποτελούν μία αρκετά πρόσφατη και πολλά υποσχόμενη νέα τεχνολογία που βρίσκει πληθώρα εφαρμογών. Λόγω της ευρύτατης εφαρμοσιμότητάς της και της προφανούς θέσης που βρίσκει στο σύγχρονο κατανεμημένο υπολογιστικό κόσμο, η επιστημονική τυπική θεμελίωση των νόμων που …