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 7 of 7 for “"3-SAT"”.
-
A parallel environment for simulating quantum computation
… the discrete approximation to the solution of 3-SAT by adiabatic evolution up to 25 qubits in a reasonable time.
-
Projecting acceptance into Millersville University's Department of Industry and Technology using high school rank, social capital, SAT scores, sex, age, and race
… GPA, using the following independent variables: SAT scores, high school rank, age, sex, race and human social capital. Students who were over 23 years old when they entered the program were eliminated from the study because SAT scores or high school ranks were not available for most of them. …
-
Optimizing Quantum Annealing for Trapped Ions: Performance, Resources, and Noise Mitigation
… with numerical studies on the paradigmatic 3-SAT problem revealing an exponential improvement in the gap-scaling exponent for certain problem instances. Finally, we study non-stoquastic annealing protocols with the ferromagnetic p-spin model and a geometrically local Ising model as benchmarks, …
-
An analysis of combinatorial search spaces for a class of NP-hard problems
… optimization problems such as maximum k-satisfiability, scheduling, and problems of graph theory. In this thesis we analyze combinatorial search spaces by expanding the objective function into a (sparse) series of basis functions. While most analyses of the distribution of function values …
-
Einbettung und Charakterisierung von aligned bar 1-visibility Graphen und outer fan free Graphen
… Abschließend geben wir eine Reduktion von NAE-3-SAT auf das Erkennungsproblem von outer fan free Graphen an.
-
Investigating Topological Quantum Matter: Machine Learning Topological Phases, Topological Quantum Codes, Interplay of Disorder and Topology via Transport Phenomena and Phase Transitions
… near-term algorithms that coax useful optimisation and learning behaviour from noisy, intermediate-scale quantum processors. This dissertation attacks all three challenges through a single computational lens that marries variational wave-function design, clause-density-optimal Max-SAT …
-
Fault tolerant Euclidean K-Centers
The Euclidean k -center problem is a fundamental question in computational geometry and facility location. Given a set P of n points in Rd, the goal is to choose a set F of k center points such that the maximum distance from any point in P to its nearest center in F is minimized. Geometrically, …