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 2995 for “"Computational complexity"”.

  1. Topics in computational complexity

    <p>This thesis concerns the computational complexity of several combinatorial problems.</p><p>Chapter 1 is notation and definitions. In Chapter 2 the subgraph homeomorphism problem, for fixed pattern graphs H, is considered. For the cases H and#x2245; C<sub>6</sub>,C<sub>7</sub>,W<sub>4</sub> or …

    oxford Repository record for Topics in computational complexity (opens in a new tab)

  2. Computational Complexity Of Bi-clustering

    … on their pairwise interactions. We analyze the computational complexity of the resulting optimization problems. We show that finding optimal solutions is NP-hard and complement this result by introducing a polynomial time approximation algorithm for this bi-clustering task. This is the first …

    waterloo Repository record for Computational Complexity Of Bi-clustering (opens in a new tab)

  3. Computational Complexity of Bi-clustering.

    … algorithm for exact bi-clustering problems. The computational complexity of bi-clustering problems depends on the exact problem formulation, and particularly on the merit function used to evaluate the quality of a given bi-clustering partition. The computational complexity of most of the common …

    waterloo Repository record for Computational Complexity of Bi-clustering. (opens in a new tab)

  4. Computational Complexity of Hopfield Networks

    There are three main results in this dissertation. They are PLS-completeness of discrete Hopfield network convergence with eight different restrictions, (degree 3, bipartite and degree 3, 8-neighbor mesh, dual of the knight's graph, hypercube, butterfly, cube-connected cycles and shuffle-exchange), …

    unt Repository record for Computational Complexity of Hopfield Networks (opens in a new tab)

  5. Finite-state quantum computational complexity

    The automatic complexity of finite words was introduced by Shallit and Wang (2001) as a computable and visual analogue to Kolmogorov complexity. It measures the complexity of a word $x$ as the minimum number of states of a finite automaton that uniquely accepts $x$. Here, an automaton $M$ uniquely …

    hawaii Repository record for Finite-state quantum computational complexity (opens in a new tab)

  6. Computational Complexity in Analysis and Geometry

    … However, application of this approach to computational complexity has been limited in generality. In this thesis, we present a refined framework that is suitable for discussing computational complexity. The key idea is to use (a certain class of) string functions as names representing …

    toronto-retro Repository record for Computational Complexity in Analysis and Geometry (opens in a new tab)

  7. 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. …

    uiuc Repository record for Computational complexity of random-access models (opens in a new tab)

  8. Inherently quantum lower bounds on computational complexity

    Computational complexity theory is usually phrased in terms of decision problems and Boolean functions, whose inputs and outputs are purely classical. However, many quantum computational tasks motivated by physics, machine learning, and cryptography involve operation on quantum information in a …

    texas Repository record for Inherently quantum lower bounds on computational complexity (opens in a new tab)

  9. 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 …

    anu Repository record for Computational Complexity of Electrical Power System Problems (opens in a new tab)

  10. Extremal combinatorics, graph limits and computational complexity

    <p>This thesis is primarily focused on problems in extremal combinatorics, although we will also consider some questions of analytic and algorithmic nature. </p> <p>The <em>d-dimensional hypercube</em> is the graph with vertex set {0,1}<sup><em>d</em></sup> where two vertices are adjacent if they …

    oxford Repository record for Extremal combinatorics, graph limits and computational complexity (opens in a new tab)

  11. Computational complexity analysis of linear optimization algorithms

    Computational complexity and performance analysis in Linear Optimization algorithms have always been topics of particular interest among the Operational Research community. In the current thesis, we are presenting all aspects and analysis results of our study on the performance of the Exterior …

    greece Repository record for Computational complexity analysis of linear optimization algorithms (opens in a new tab)

  12. 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 …

    vt Repository record for Turing Decidability and Computational Complexity of MorseHomology (opens in a new tab)

  13. The computational complexity of edge colouring restricted graphs

    … NP­-complete. This thesis investigates the computational complexity of edge colouring restricted graphs. Previous work has established that the chromatic index problem restricted to k­-regular graphs for any fixed k-3 remains NP-complete, whereas the problem restricted to bipartite graphs …

    uvic Repository record for The computational complexity of edge colouring restricted graphs (opens in a new tab)

  14. Computational Complexity of Soundness Verification for Neural Networks

    … ubiquitous tool in systems of varying complexity across a range of domains. While these tools can be used to learn and predict complex functions, their opaque nature limits the scope of their acceptable applications. In particular, a lack of performance guarantees means that they are …

    wustl Repository record for Computational Complexity of Soundness Verification for Neural Networks (opens in a new tab)

  15. String Measures: Computational Complexity and Related Problems in Communication

    … These applications motivated the study of the computational complexity of string related problems as well as a better understanding of edit operations on strings in general. In this thesis, we study several problems related to edit type string measures and error correcting codes for edit …

    jhu Repository record for String Measures: Computational Complexity and Related Problems in Communication (opens in a new tab)

  16. Computational complexity perspective on graphical calculi for quantum computation

    … the wider adoption of diagrammatic reasoning. Computational complexity theory formalises the difficulty of problems. For ZX diagrams, the circuit extraction problem is #P-hard and unlikely to have an efficient algorithm. Therefore, partial solutions are critical. Currently, efficient circuit …

    birmingham Download PDF for Computational complexity perspective on graphical calculi for quantum computation (opens in a new tab)

  17. Managing computational complexity through using partitioning, approximation and coordination

    … many interdependent subsystems with a level of complexity that exceeds the ability of a single designer. One way to address this problem is to partition the complex design problem into smaller, more manageable design tasks that can be handled by multiple design teams. Partitioning-based design …

    oklahoma-thes Repository record for Managing computational complexity through using partitioning, approximation and coordination (opens in a new tab)

Page 1 of 150