- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
An Automaton Group with PSPACE-Complete Word Problem ; day:21 ; month:4 ; year:2022 ; pages:1-41
Theory of computing systems ; (21.4.2022), 1-41
- Urheber
-
Wächter, Jan Philipp
Weiß, Armin
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-021-10064-7
- URN
-
urn:nbn:de:101:1-2022070319552975425860
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:35 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.
Beteiligte
- Wächter, Jan Philipp
- Weiß, Armin
- SpringerLink (Online service)
Ähnliche Objekte (12)
Complete information pivotal-voter model with asymmetric group size
Parallel algorithms for power circuits and the word problem of the Baumslag group
Parallel algorithms for power circuits and the word problem of the Baumslag group
Group activity selection problem with approval preferences
Group activity selection problem with approval preferences
Word problems for finite nilpotent groups
Quantum superiority for verifying NP-complete problems with linear optics
Historical word sense clustering with deep contextualized word embeddings
The transfer problem: A complete characterization
Probleme bei der Weiterverarbeitung von Word-Dokumenten
On the word problem for special monoids
The power word problem in graph groups
Complete information pivotal-voter model with asymmetric group size
Parallel algorithms for power circuits and the word problem of the Baumslag group
Parallel algorithms for power circuits and the word problem of the Baumslag group
Group activity selection problem with approval preferences
Group activity selection problem with approval preferences
Word problems for finite nilpotent groups
Quantum superiority for verifying NP-complete problems with linear optics
Historical word sense clustering with deep contextualized word embeddings
The transfer problem: A complete characterization
Probleme bei der Weiterverarbeitung von Word-Dokumenten
On the word problem for special monoids
The power word problem in graph groups
Complete information pivotal-voter model with asymmetric group size
Parallel algorithms for power circuits and the word problem of the Baumslag group
Parallel algorithms for power circuits and the word problem of the Baumslag group
Group activity selection problem with approval preferences
Group activity selection problem with approval preferences
Word problems for finite nilpotent groups
Quantum superiority for verifying NP-complete problems with linear optics
Historical word sense clustering with deep contextualized word embeddings
The transfer problem: A complete characterization
Probleme bei der Weiterverarbeitung von Word-Dokumenten
On the word problem for special monoids