Chennai Mathematical Institute

Results: 93



#Item
1

The Okounkov-Vershik approach to the representation theory of G ∼ Sn Ashish Mishra Chennai Mathematical Institute H1, SIPCOT IT Park, Siruseri Kelambakkam, Chennai, INDIA

Add to Reading List

Source URL: www.math.iitb.ac.in

Language: English - Date: 2016-03-03 02:58:32
    2

    Existential Assertions for Voting Protocols R. Ramanujam1 , Vaishnavi Sundararajan2 , and S.P. Suresh2 1 Institute of Mathematical Sciences Chennai, India.

    Add to Reading List

    Source URL: www.cmi.ac.in

    Language: English - Date: 2017-02-14 08:25:22
      3

      REPLICATED DATA, 
 FROM PRACTICE TO THEORY Madhavan Mukund Chennai Mathematical Institute and UMI RELAX, Chennai, India Joint work with Gautham Shenoy R, S P Suresh

      Add to Reading List

      Source URL: www.lsv.fr

      Language: English - Date: 2017-05-22 04:51:19
        4

        NON-STABILIZER QUANTUM CODES FROM ABELIAN SUBGROUPS OF THE ERROR GROUP V. ARVIND, PIYUSH P KURUR, AND K. R. PARTHASARATHY Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,krp,ppk}@ims

        Add to Reading List

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

        - Date: 2016-07-30 09:35:21
          5

          On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach∗ V. Arvind The Institute of Mathematical Sciences Chennai, India

          Add to Reading List

          Source URL: www.cs.uwm.edu

          - Date: 2008-03-04 12:22:17
            6

            FSTTCS  th FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE December 13–15, 2016 Chennai Mathematical Institute, Chennai, India CALL FOR PAPERS

            Add to Reading List

            Source URL: www.fsttcs.org

            - Date: 2016-06-06 10:09:04
              7Computational 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

              Language: English - Date: 2016-07-30 09:35:21
              8Mathematical analysis / Ergodic theory / Stochastic processes / Algebra / Abstract algebra / Lie groups / Quantum group / Mixing / Representation theory / Mutation / Ergodicity / Dynamical system

              Automorphisms of Compact Quantum Groups joint work with Kunal Mukherjee Issan Patri July 15, 2016 Institute of Mathematical Sciences (IMSc), Chennai

              Add to Reading List

              Source URL: www.wiko-greifswald.de

              Language: English - Date: 2016-07-19 06:40:01
              9Science and technology in India / Mathematics / Education in Chennai / Vyjayanthi Chari / Chennai Mathematical Institute / Institute of Mathematical Sciences /  Chennai / Department of Atomic Energy / IMSC / Michel Demazure

              R. VENKATESH Curriculum Vitae October 2014

              Add to Reading List

              Source URL: www.math.tifr.res.in

              Language: English - Date: 2014-11-05 03:36:30
              10Complexity 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

              Language: English - Date: 2016-07-30 09:35:21
              UPDATE