- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783863601270
3863601270
- Maße
-
21 cm, 350 g
- Umfang
-
xiii, 228 Seiten
- Sprache
-
Englisch
- Anmerkungen
-
Illustrationen
Technische Universität Ilmenau, Dissertation, 2015
- Schlagwort
-
Endlicher Automat
Prädikatenlogik
Ordinalzahl
Lineare Ordnung
Ramsey-Zahl
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
Universitätsverlag Ilmenau
- (wann)
-
2016
- Urheber
-
Huschenbett, Martin
- Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:25 MESZ
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
- Huschenbett, Martin
- Ilmenau Media Services
- Universitätsverlag Ilmenau
Entstanden
- 2016
Ähnliche Objekte (12)
The model-theoretic complexity of automatic linear orders
Isomorphisms of scattered automatic linear orders
Circuit complexity of group theoretic problems
Complexity theoretic lower bounds on cryptographic functions
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Number theoretic methods in cryptography : complexity lower bounds
Linear orders in NIP theories
Plan modification versus plan generation : a complexity theoretic perspective
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
A complexity-theoretic approach to disproving Connes' Embedding Problem
A Finite-Model-Theoretic View on Propositional Proof Complexity
Automatic complexity : a computable measure of irregularity
The model-theoretic complexity of automatic linear orders
Isomorphisms of scattered automatic linear orders
Circuit complexity of group theoretic problems
Complexity theoretic lower bounds on cryptographic functions
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Number theoretic methods in cryptography : complexity lower bounds
Linear orders in NIP theories
Plan modification versus plan generation : a complexity theoretic perspective
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
A complexity-theoretic approach to disproving Connes' Embedding Problem
A Finite-Model-Theoretic View on Propositional Proof Complexity
Automatic complexity : a computable measure of irregularity
The model-theoretic complexity of automatic linear orders
Isomorphisms of scattered automatic linear orders
Circuit complexity of group theoretic problems
Complexity theoretic lower bounds on cryptographic functions
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Number theoretic methods in cryptography : complexity lower bounds
Linear orders in NIP theories
Plan modification versus plan generation : a complexity theoretic perspective
Graph-Theoretic Complexity Reduction for Markovian Wireless Channel Models
A complexity-theoretic approach to disproving Connes' Embedding Problem
A Finite-Model-Theoretic View on Propositional Proof Complexity