On the graph isomorphism problem

Simple item page
dc.creatorFriedland, Shmuel
dc.date2008-01-02
dc.date2008-01-10
dc.date.accessioned2026-07-07T08:53:26Z
dc.date.available2026-07-07T08:53:26Z
dc.descriptionWe relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/0801.0398
dc.identifierhttp://arxiv.org/abs/0801.0398
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145620
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectG.2.2; F.2.2
dc.titleOn the graph isomorphism problem
dc.typetext

Files

Collections

arXiv