2000•Lecture notes in computer scienceRequires access
On the Complexity of Finite Sorted Algebras
Thierry Boy de la Tour
Open publisher page 4 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Thierry Boy de la Tour
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Graph isomorphism, Isomorphism (crystallography), Signature (topology), Computer science, Subgraph isomorphism problem, Discrete mathematics, Mathematics, Graph