- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Stuttgart, Universität Stuttgart, Dissertation, 2021
- Keyword
-
Wortproblem
Endliche Gruppe
- Event
-
Veröffentlichung
- (where)
-
Stuttgart
- (who)
-
Universitätsbibliothek der Universität Stuttgart
- (when)
-
2021
- Creator
- Contributor
- DOI
-
10.18419/opus-12033
- URN
-
urn:nbn:de:bsz:93-opus-ds-120506
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:44 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.
Associated
- Weiß, Armin
- Diekert, Volker
- Universitätsbibliothek der Universität Stuttgart
Time of origin
- 2021
Other Objects (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