Hochschulschrift
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2009
- Schlagwort
-
Komplexität ; Kombinatorik ; Algorithmus ; Graphenisomorphie ; Ramsey-Zahl
- Urheber
-
Schweitzer, Pascal
- URN
-
urn:nbn:de:bsz:291-scidok-24256
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Schweitzer, Pascal
Ähnliche Objekte (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