- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Stuttgart, Universität Stuttgart, Dissertation, 2021
- Schlagwort
-
Wortproblem
Endliche Gruppe
- Ereignis
-
Veröffentlichung
- (wo)
-
Stuttgart
- (wer)
-
Universitätsbibliothek der Universität Stuttgart
- (wann)
-
2021
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.18419/opus-12033
- URN
-
urn:nbn:de:bsz:93-opus-ds-120506
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:44 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.
Beteiligte
- Weiß, Armin
- Diekert, Volker
- Universitätsbibliothek der Universität Stuttgart
Entstanden
- 2021
Ähnliche Objekte (12)
A complexity-theoretic approach to disproving Connes' Embedding Problem
Circuit Complexity in Z2 EEFT
On the space and circuit complexity of parameterized problems
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
Characterising QBF Hardness via Circuit Complexity
Complexity theoretic lower bounds on cryptographic functions
Descriptive complexity of circuit-based counting classes
Finite automata, formal logic, and circuit complexity
Introduction to circuit complexity : a uniform approach
The model-theoretic complexity of automatic linear orders
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
A complexity-theoretic approach to disproving Connes' Embedding Problem
Circuit Complexity in Z2 EEFT
On the space and circuit complexity of parameterized problems
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
Characterising QBF Hardness via Circuit Complexity
Complexity theoretic lower bounds on cryptographic functions
Descriptive complexity of circuit-based counting classes
Finite automata, formal logic, and circuit complexity
Introduction to circuit complexity : a uniform approach
The model-theoretic complexity of automatic linear orders
The model-theoretic complexity of automatic linear orders
Number theoretic methods in cryptography : complexity lower bounds
A complexity-theoretic approach to disproving Connes' Embedding Problem
Circuit Complexity in Z2 EEFT
On the space and circuit complexity of parameterized problems
Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers
Characterising QBF Hardness via Circuit Complexity
Complexity theoretic lower bounds on cryptographic functions
Descriptive complexity of circuit-based counting classes
Finite automata, formal logic, and circuit complexity
Introduction to circuit complexity : a uniform approach
The model-theoretic complexity of automatic linear orders
The model-theoretic complexity of automatic linear orders