Ergebnisse für: computationally hard problems
Hier findest Du Bücher, die sich mit computationally hard problems beschäftigen.
This thesis explores and exploits structure inherent in voting problems. Some of these structures are found in the preferences of the voters, such as the domain restrictions which have been widely studied in social choice theory [ASS02, ASS10]. Others can be expressed as quantifiable measures (or pa...
This thesis is concerned with analyzing the computational complexity of NP-hard problems related to data science. For most of the problems considered in this thesis, the computational complexity has not been intensively studied before. We focus on the complexity of computing exact problem solutions ...
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acycl...