<--- Back to Details
First PageDocument Content
Complexity classes / Finite groups / Combinatorial group theory / Graph isomorphism problem / Morphisms / Hidden subgroup problem / Permutation group / Permutation / Graph canonization / ArthurMerlin protocol / Graph automorphism / NP
Date: 2016-07-30 09:35:21
Complexity classes
Finite groups
Combinatorial group theory
Graph isomorphism problem
Morphisms
Hidden subgroup problem
Permutation group
Permutation
Graph canonization
ArthurMerlin protocol
Graph automorphism
NP

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

Add to Reading List

Source URL: www.cse.iitk.ac.in

Download Document from Source Website

File Size: 298,54 KB

Share Document on Facebook

Similar Documents

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

DocID: 1ppLN - View Document

PDF Document

DocID: 16E9w - View Document

A Logspace Algorithm for Tree Canonization (Extended Abstract) Steven Lindell †

A Logspace Algorithm for Tree Canonization (Extended Abstract) Steven Lindell †

DocID: 62Sp - View Document

PDF Document

DocID: oZ6 - View Document