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 693 for “"Computational Complexity"”.
-
Computational complexity of random-access models
The relative power of several computational models is considered. These models are the Turing machine and its multidimensional variant, the random access machine (RAM), the tree machine, and the pointer machine. The basic computational properties of the pointer machine are examined in more detail. …
-
A Dual Perspective on Computational Complexity
… economy relies critically on its truth. Indeed, complexity theorists generally believe the much stronger Exponential Time Hypothesis (ETH). However, despite decades of work, these conjectures remain open, as do much weaker conjectures such as P ≠ PSPACE. The aforementioned discrepancy between …
-
Computational Complexity of Electrical Power System Problems
The study of the computational complexity of real-world applications, although theoretical, can provide many pragmatic outcomes. For example, demonstrating that some types of algorithms cannot exist to solve the problem; the creation of challenging benchmark examples; and new insights into the …
-
Computational Complexity of Electrical Power System Problems
The study of the computational complexity of real-world applications, although theoretical, can provide many pragmatic outcomes. For example, demonstrating that some types of algorithms cannot exist to solve the problem; the creation of challenging benchmark examples; and new insights into the …
-
Relativization of the theory of computational complexity.
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1972.
-
Turing Decidability and Computational Complexity of MorseHomology
… as well as an introduction to computability and computational complexity. Since general point-set data equipped with a smooth structure can admit a triangulation, discrete Morse theory finds numerous applications in data analysis which can range from traffic control to geographical …
-
Some hardness escalation results in computational complexity theory
… we prove new hardness escalation results in computational complexity theory; a phenomenon where hardness results against seemingly weak models of computation for any problem can be lifted, in a black box manner, to much stronger models of computation by considering a simple gadget composed …
-
The computational complexity of prefix classes of logical theories
We derive upper and lower bounds on the computational complexity of prefix classes of several logical theories. The general method for obtaining lower bounds on the complexity of logical theories developed by Compton and Henson is adapted for their prefix classes. We are then able to show that for …
-
Computational Complexity Optimization on H.264 Scalable/Multiview Video Coding
… at low bitrates, it enormously increases the computational complexity. The research described in this thesis focuses on optimization of the computational complexity on H.264 scalable and multiview video coding. Nowadays, video application areas range from multimedia messaging and mobile to …
-
Computational complexity of certain quantum theories in 1+1 dimensions
… observables like mass and temperature, and also complexity at the same time. For example, similar to saying that one object is heavier than the other, we can discuss which system is more complex. According to this point of view, a more complex system can be interpreted as the one which can be …
-
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
… NC-hierarchy (and above). We apply Communication Complexity to show a streaming lower bound for a model with an unbounded (free-to-access) pushdown storage. In particular, we obtain a nΩ(1) lower bound simultaneously in the space and in the number of passes over the input, for a variant of inner …
-
The Computational Complexity of Some Games and Puzzles With Theoretical Applications
… con- </p> <p>nections with other classical computational problems, such as Perfect Multi- </p> <p>Dimensional Matching, Set Packing, Independent Edge Dominating Set, </p> <p>and Arc Kayles. We prove algorithmic and hardness results in the classical and </p> <p>the parameterized sense. </p> …
-
On the computational complexity of portal and push-pull block puzzles
We classify the computational complexity of two types of motion planning problems represented in games. Portal, a popular video game, is shown to be NP-hard or PSPACE-complete depending on the game mechanics allowed. Push-pull block puzzles are games, similar to Sokoban, which involve moving a …
-
Overcoming Computational Complexity Barriers for Optimal Transport in Discrete and Semi-Discrete Settings
… that outputs the mass of $mu$ inside a constant-complexity region in $O(1)$ time. In this thesis, given a parameter $varepsilon>0$, we present the following results for the semi-discrete OT problem between $mu$ and $nu$: 1. Additive approximation for semi-discrete OT: We present an …
-
Subway Shuffle, 1 × 1 Rush Hour, and Cooperative Chess Puzzles: Computational Complexity of Puzzles
Oriented Subway Shuffle is a game played on a directed graph with colored edges and colored tokens present on some vertices. A move consists of moving a token across an edge of the matching color to an unoccupied vertex and reversing the orientation of that edge. The goal is to move a token across …
-
Modeling and analysis of automated manufacturing systems with focus on equilavence and computational complexity
Thesis (M.S.)--Massachusetts Institute of Technology, Alfred P. Sloan School of Management, 1982.
-
Low computational complexity bit error rate simulation for personal communications systems in multipath and fading environments
… techniques have resulted in extremely high computational complexity, limiting the number of design options which may be explored. This thesis presents a multirate simulation technique which allows an order of magnitude reduction in simulation times for digital systems on multipath channels. …
-
Complexity management for video encoders.
… video encoders and decoders is limited by computational complexity. This thesis presents research work to develop techniques to manage computational complexity of video encoders. These techniques aim to provide significant complexity saving as well as adaptively controlling the …
Page 1 of 35