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 11 of 11 for “"Descriptive Complexity"”.
-
Descriptive complexity of constraint problems
… yet.) In this thesis, we approach the complexity of constraint problems from a descriptive complexity perspective. Namely, instead of studying the computational resources necessary to solve certain constraint problems, we consider the expressive power necessary to define these problems …
-
Project complexity and how to effectively measure complexity in projects: the case of a refuelling outage in a nuclear power generating plant
… reasons for project failure is the increasing complexity of projects or an underestimation of the project complexity. There is therefore a fundamental need to develop a tool or model that will assist project managers to measure complexity within their projects Research Purpose: To define …
-
Topics on the geometry and classification of Banach lattices
… 3 and 4) presents various results on the descriptive complexity of classes of Banach lattices and determines the complexity of the lattice isomorphism and isometry equivalence relations. The focus of the third part (Chapter 5) is the construction of a lattice isometrically universal …
-
In pursuit of linear complexity in discrete and computational geometry
… meshes, and (iii) bounding the expected complexity of weighted Voronoi diagrams. While these topics are broad, here the focus is on identifying structure which implies linear (or near linear) algorithmic and descriptive complexity. The first topic we consider is in geometric optimization. …
-
Average-case complexity of detecting cliques
… and unbounded-depth monotone circuits, the complexity measure is the number of gates, and the input distributions are random graphs with an appropriate density of edges. Such random graphs (the well-studied Erdos-Renyi random graphs) are widely believed to be a source of computationally hard …
-
Transitive Closure Logic and Multihead Automata with Nested Pebbles
… extensions 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 …
-
Variations on the Theme of Higher Dimensional Weisfeiler-Leman Algorithms
… insights into the nature and computational complexity of graph isomorphism, as well as the descriptive complexity of finite graphs. We also use refinement operators to bound the expressive power of an infinitary logic with solvability quantifiers so as to study the relative power of the …
-
A formalism for describing and simulating systems with interacting components.
This thesis addresses the problem of descriptive complexity presented by systems involving a high number of interacting components. It investigates the evaluation measure of performability and its application to such systems. A new description and simulation language, ICE and it's application to …
-
Symmetric Circuits and Model-Theoretic Logics
… this new-found connection between circuit complexity and descriptive complexity.
-
Game comonads and beyond: compositional constructions for logic and algorithms
… methods to the fields of finite model theory and descriptive complexity. First introduced by Abramsky, Dawar and Wang in 2017, these new constructions exposed connections between Spoiler-Duplicator games used in logic, related algorithms for constraint satisfaction and structure isomorphism, and …
-
From game comonads to dynamical systems: property-preserving maps as a logical unifying principle
… semantics alone, computational aspects such as complexity and decidability hinge on the syntactic properties of formal languages. This interplay frequently manifests through relations between structures, which establish their similarity in various ways and for different purposes. In this work, …