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 5 of 5 for “"Komplexitätstheorie"”.
-
Eine kanonische Form zur Darstellung äquivalenter Codes : Computergestützte Berechnung und ihre Anwendung in der Codierungstheorie, Kryptographie und Geometrie
… Zeitaufwand. Dieses Vorgehen wird im Sinne der Komplexitätstheorie durch den Beweis der Aussage, dass das Äquivalenzproblem für lineare Codes mindestens so schwer wie das Isomorphieproblem für Graphen ist, gerechtfertigt. Die Arbeit schließt mit verschiedenen Modifikationen an dem …
-
Algebraic closures in complexity theory
We use algebraic closures and structures which are derived from these in complexity theory. We classify problems with Boolean circuits and Boolean constraints according to their complexity. We transfer algebraic structures to structural complexity. We use the generation problem to classify …
-
Nash equilibria and improvement dynamics in congestion games
Communication infrastructures and markets are maintained and used by millions of entities each of them facing a private objective. The vast number of participants in conjunction with their individual goals to choose the best alternative gave rise to study such scenarios in the framework of game …
-
Generalized Satisfiability Problems
In the last 40 years, complexity theory has grown to a rich and powerful field in theoretical computer science. The main task of complexity theory is the classification of problems with respect to their consumption of resources (e.g., running time or required memory). To study the computational …
-
Complexity and Partitions
Computational complexity theory usually investigates the complexity of sets, i.e., the complexity of partitions into two parts. But often it is more appropriate to represent natural problems by partitions into more than two parts. A particularly interesting class of such problems consists of …