- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0622
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
An identification system based on the explicit isomorphism problem ; day:19 ; month:10 ; year:2021 ; pages:1-18
Applicable algebra in engineering, communication and computing ; (19.10.2021), 1-18
- Creator
-
Kiss, Sándor Z.
Kutas, Péter
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00200-021-00529-0
- URN
-
urn:nbn:de:101:1-2022011220260050322128
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:31 AM CEST
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
- Kiss, Sándor Z.
- Kutas, Péter
- SpringerLink (Online service)
Other Objects (12)
On the blockwise modular isomorphism problem
The Modular Isomorphism Problem: A Survey
Partial Isomorphism
The graph isomorphism problem : its structural complexity
The isomorphism problem for cominuscule Schubert varieties
Bounded birationality and isomorphism problems are computable
Combinatorial approaches to the group isomorphism problem
Mechanism Isomorphism Identification Based on Decision Tree Algorithm and Hybrid Particle Swarm Optimization Algorithm
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
A new method for isomorphism identification of planetary gear trains
Tensor Isomorphism: completeness, graph-theoretic methods, and consequences for Group Isomorphism
On the blockwise modular isomorphism problem
The Modular Isomorphism Problem: A Survey
Partial Isomorphism
The graph isomorphism problem : its structural complexity
The isomorphism problem for cominuscule Schubert varieties
Bounded birationality and isomorphism problems are computable
Combinatorial approaches to the group isomorphism problem
Mechanism Isomorphism Identification Based on Decision Tree Algorithm and Hybrid Particle Swarm Optimization Algorithm
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
A new method for isomorphism identification of planetary gear trains
Tensor Isomorphism: completeness, graph-theoretic methods, and consequences for Group Isomorphism
On the blockwise modular isomorphism problem
The Modular Isomorphism Problem: A Survey
Partial Isomorphism
The graph isomorphism problem : its structural complexity
The isomorphism problem for cominuscule Schubert varieties
Bounded birationality and isomorphism problems are computable
Combinatorial approaches to the group isomorphism problem
Mechanism Isomorphism Identification Based on Decision Tree Algorithm and Hybrid Particle Swarm Optimization Algorithm
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
A new method for isomorphism identification of planetary gear trains