On the hardness of graph isomorphism

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 180-186

  Toran, Jacobo ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MORPHOLOGY; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

GRAPH ISOMORPHISMS; PROBABILISTIC LOGARITHMIC SPACES;

COMPUTER SCIENCE;

EID: 0034514003     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)