Linear Diophantine Equations, Group CSPs, and Graph Isomorphism

DOI10.1137/1.9781611974782.21zbMath1410.68153arXiv1607.04287OpenAlexW2516889374MaRDI QIDQ4575758

Martin Grohe, Christoph Berkholz

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Linear Diophantine equations (11D04) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Quantum and non-signalling graph isomorphisms ⋮ Unnamed Item

This page was built for publication: Linear Diophantine Equations, Group CSPs, and Graph Isomorphism