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 4 of 4 for “"Algorithms and computational complexity"”.
-
Graphical structure of unsatisfiable boolean formulae
The presented research is an introduction and analysis of a novel graph decision problem called GraphSAT. Using the tools of topology and 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 …
-
MULTIHIERARCHICAL DOCUMENTS AND FINE-GRAINED ACCESS CONTROL
This work presents new models and algorithms for creating, modifying, and controlling access to complex text. The digitization of texts opens new opportunities for preservation, access, and analysis, but at the same time raises questions regarding how to represent and collaboratively edit such …
-
Responsibility and norms in multiagent systems
… multiagent systems that integrate both human and artificial actors.<br/>The governance of such hybrid multiagent systems has thus become a pressing and timely concern. In this thesis, I adopt a formal approach to investigate the theoretical foundations of responsibility and norms in multiagent …
-
Algorithmic and game-theoretic aspects of computational social choice
… them through an algorithmic, game-theoretic and axiomatic lens. The central objective is to identify voting procedures that can increase agents’ desire to participate in collective governance and improve voters’ participation experience. Therefore, we focus on suggesting and analysing voting …