Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

First Page		Document Content
Date: 2016-07-30 09:35:21 Computational complexity theory Theory of computation Complexity classes Graph isomorphism problem NP PP Low Graph automorphism Hidden subgroup problem Time complexity P Chromatic polynomial		Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is Add to Reading List Source URL: www.cse.iitk.ac.in Download Document from Source Website File Size: 287,67 KB Share Document on Facebook

	3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen DocID: 1vjcF - View Document
	Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is DocID: 1rkqP - View Document
	Permutation groups and the graph isomorphism problem Sumanta Ghosh and Piyush P Kurur Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India DocID: 1r7bO - View Document
	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS LOCALLY INJECTIVE HOMOMORPHISMS DocID: 1r5we - View Document
	Open Problems from the Workshop on Algebra and CSPs August, Fields Institute, Toronto September 30, 2011 This is a list of open problems from the algebra workshop which was a part of the Summer Thematic Program DocID: 1qFWi - View Document