Hochschulschrift
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Saarbrücken, Univ., Diss., 2009
- Keyword
-
Komplexität ; Kombinatorik ; Algorithmus ; Graphenisomorphie ; Ramsey-Zahl
- Creator
-
Schweitzer, Pascal
- URN
-
urn:nbn:de:bsz:291-scidok-24256
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:43 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Schweitzer, Pascal
Other Objects (12)
Ramsey numbers for partially ordered sets
Numbers and topologies : two aspects of ramsey theory
Numbers and topologies : two aspects of Ramsey theory
Circuit complexity of group theoretic problems
Complexity theoretic lower bounds on cryptographic functions
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
The model-theoretic complexity of automatic linear orders
A complexity-theoretic approach to disproving Connes' Embedding Problem
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
A Finite-Model-Theoretic View on Propositional Proof Complexity
Plan modification versus plan generation : a complexity theoretic perspective
Ramsey numbers for partially ordered sets
Numbers and topologies : two aspects of ramsey theory
Numbers and topologies : two aspects of Ramsey theory
Circuit complexity of group theoretic problems
Complexity theoretic lower bounds on cryptographic functions
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
The model-theoretic complexity of automatic linear orders
A complexity-theoretic approach to disproving Connes' Embedding Problem
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
A Finite-Model-Theoretic View on Propositional Proof Complexity
Plan modification versus plan generation : a complexity theoretic perspective
Ramsey numbers for partially ordered sets
Numbers and topologies : two aspects of ramsey theory
Numbers and topologies : two aspects of Ramsey theory
Circuit complexity of group theoretic problems
Complexity theoretic lower bounds on cryptographic functions
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
The model-theoretic complexity of automatic linear orders
A complexity-theoretic approach to disproving Connes' Embedding Problem
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
A Finite-Model-Theoretic View on Propositional Proof Complexity