Logspace computations in graph products

DOI10.1145/2608628.2608642zbMath1325.68106arXiv1309.1290OpenAlexW2052852316MaRDI QIDQ5899516

Volker Diekert, Jonathan Kausch

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.1290

zbMATH Keywords

algorithmic group theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Logspace computations in graph products

Uses Software

• Jordan

Cites Work

• Jordan
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Logspace computations in graph products